Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Λ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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Many language designers have adopted gradual typing. However, there remains open questions regarding how to gradualize languages… Expand
  • figure 1
  • figure 5
  • figure 6
Is this relevant?
2016
2016
Many languages are beginning to integrate dynamic and static typing. Siek and Taha offered gradual typing as an approach to this… Expand
  • figure 4
  • figure 3
  • figure 6
  • figure 7
Is this relevant?
2015
2015
We present a new interpreter for λProlog that runs consistently faster than the byte code compiled by Teyjus, that is believed to… Expand
Is this relevant?
2013
2013
Consider a world where exporting proof evidence into a declarative, universal, and permanent format is taken as ``feature zero… Expand
Is this relevant?
2004
2004
We study the relative expressive power of Fusion and pi-calculus. Fusion is commonly regarded as a generalisation of pi-calculus… Expand
  • table 1
Is this relevant?
1999
1999
Higher-order, typed logic programming languages such as lambda-Prolog and Twelf have emerged in this last decade as the solution… Expand
  • figure 10.1
  • figure 13.2
  • figure 13.4
  • figure 13.5
  • figure 13.8
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The logic programming language λProlog is based on the intuitionistic theory of higher-order hereditary Harrop formulas, a logic… Expand
Is this relevant?
1999
1999
The language lambdaProlog incorporates a module notion that permits the space of names and procedure declarations to be… Expand
Is this relevant?
1993
1993
  • Amy P. Felty
  • [] Proceedings Eighth Annual IEEE Symposium on…
  • 1993
  • Corpus ID: 1178551
The author presents an encoding of the calculus of constructions (CC) in a higher-order intuitionistic logic (I) in a direct way… Expand
  • figure 1
  • figure 4
  • figure 5
Is this relevant?
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
Is this relevant?