Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
ΛProlog
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
In a world where trusting software systems is problematic, formal methods and formal proofs should be able to help. Proof… Expand
2004
2004
$\lambda$Prolog is known to be well-suited for expressing and implementing logics and inference systems. We show that lemmas and… Expand
2002
2002
A logical framework is a meta-language for the formalization of deductive systems. We provide a brief introduction to logical… Expand
2000
2000
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the… Expand
2000
2000
We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of… Expand
Highly Cited
1999
Highly Cited
1999
Higher-order, typed logic programming languages such as lambda-Prolog and Twelf have emerged in this last decade as the solution… Expand
Highly Cited
1991
Highly Cited
1991
The unification of simply typed ‚-terms modulo the rules of fl- and ·-conversions is often called “higher-order” unification… Expand
Highly Cited
1991
Highly Cited
1991
Natural semantics, a form of operational semantics, provides a high-level and elegant means of specifying interpreters for… Expand
Highly Cited
1989
Highly Cited
1989
A description is given of Elf, a metalanguage for proof manipulation environments that are independent of any particular logical… Expand
Highly Cited
1987
Highly Cited
1987
By permitting function and predicate symbols to be variables and by replacing first-order terms by simply typed $lambda$-terms, a… Expand