Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,177,944 papers from all fields of science
Search
Sign In
Create Free Account
ΛProlog
Known as:
LProlog
, Lambda prolog
, LambdaProlog
λProlog, also written lambda Prolog, is a logic programming language featuring polymorphic typing, modular programming, and higher-order programming…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Higher-order abstract syntax
Higher-order programming
Lambda calculus
List of programming languages by type
Expand
Broader (1)
Logic in computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Automatically generating the dynamic semantics of gradually typed languages
M. Cimini
,
Jeremy G. Siek
ACM-SIGACT Symposium on Principles of Programming…
2017
Corpus ID: 10880079
Many language designers have adopted gradual typing. However, there remains open questions regarding how to gradualize languages…
Expand
2016
2016
Proof checking and logic programming
D. Miller
Formal Aspects of Computing
2016
Corpus ID: 7296708
In a world where trusting software systems is increasingly important, formal methods and formal proof can help provide some basis…
Expand
2015
2015
ELPI: Fast, Embeddable, λProlog Interpreter
Tsvetan Dunchev
,
F. Guidi
,
C. Coen
,
E. Tassi
Logic Programming and Automated Reasoning
2015
Corpus ID: 11656846
We present a new interpreter for $$\lambda $$Prolog that runs consistently faster than the byte code compiled by Teyjus, that is…
Expand
Highly Cited
1999
Highly Cited
1999
Higher-Order Rewriting with Dependent Types
R. Virga
,
Peter B. Andrews
,
R. Harper
,
R. Statman
1999
Corpus ID: 115398018
Higher-order, typed logic programming languages such as lambda-Prolog and Twelf have emerged in this last decade as the solution…
Expand
Highly Cited
1996
Highly Cited
1996
Forum: A Multiple-Conclusion Specification Logic
D. Miller
Theoretical Computer Science
1996
Corpus ID: 6444778
Highly Cited
1996
Highly Cited
1996
Efficient resource management for linear logic proof search
I. Cervesato
,
J. S. Hodas
,
F. Pfenning
Theoretical Computer Science
1996
Corpus ID: 6281428
Highly Cited
1991
Highly Cited
1991
Unification of Simply Typed Lamda-Terms as Logic Programming
D. Miller
International Conference on Logic Programming
1991
Corpus ID: 451294
The unification of simply typed ‚-terms modulo the rules of fl- and ·-conversions is often called “higher-order” unification…
Expand
Highly Cited
1989
Highly Cited
1989
Elf: a language for logic definition and verified metaprogramming
F. Pfenning
[] Proceedings. Fourth Annual Symposium on Logic…
1989
Corpus ID: 6747706
A description is given of Elf, a metalanguage for proof manipulation environments that are independent of any particular logical…
Expand
Highly Cited
1988
Highly Cited
1988
Partial polymorphic type inference and higher-order unification
F. Pfenning
LISP and Functional Programming
1988
Corpus ID: 9832421
We show that the problem of partial type inference in the nth-order polymorphic &lgr;-calculus is equivalent to nth-order…
Expand
Highly Cited
1987
Highly Cited
1987
A Logic Programming Approach to Manipulating Formulas and Programs
D. Miller
,
G. Nadathur
International Conference on Spoken Language…
1987
Corpus ID: 5278164
By permitting function and predicate symbols to be variables and by replacing first-order terms by simply typed $lambda$-terms, a…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE