λProlog, also written lambda Prolog, is a logic programming language featuring polymorphic typing, modular programming, and higher-order programming. These extensions to Prolog are derived from the higher-order hereditary Harrop formulas used to justify the foundations of λProlog. Higher-order quantification, simply typed λ-terms, and higher-order unification gives λProlog the basic supports needed to capture the λ-tree syntax approach to higher-order abstract syntax, an approach to representing syntax that maps object-level bindings to programming language bindings. Programmers in λProlog need not deal with bound variable names: instead various declarative devices are available to deal with binder scopes and their instantiations.
Attributes | Values |
---|
rdf:type
| |
rdfs:label
| - Lambda Prolog (fr)
- ΛProlog (en)
|
rdfs:comment
| - λProlog ou lambda Prolog est un langage de programmation logique dérivé de Prolog. λProlog est une double extension de Prolog, dans un premier temps, en rajoutant les λ-termes et dans un second temps avec l'ajout de nouveaux connecteurs tels que l'implication et le quantificateur universel.Lambda Prolog introduit également la notion de type simple. (fr)
- λProlog, also written lambda Prolog, is a logic programming language featuring polymorphic typing, modular programming, and higher-order programming. These extensions to Prolog are derived from the higher-order hereditary Harrop formulas used to justify the foundations of λProlog. Higher-order quantification, simply typed λ-terms, and higher-order unification gives λProlog the basic supports needed to capture the λ-tree syntax approach to higher-order abstract syntax, an approach to representing syntax that maps object-level bindings to programming language bindings. Programmers in λProlog need not deal with bound variable names: instead various declarative devices are available to deal with binder scopes and their instantiations. (en)
|
foaf:name
| |
foaf:homepage
| |
name
| |
foaf:page
| |
dcterms:subject
| |
Wikipage page ID
| |
Wikipage revision ID
| |
Link from a Wikipage to another Wikipage
| |
Link from a Wikipage to an external page
| |
sameAs
| |
dbp:wikiPageUsesTemplate
| |
designers
| - Dale Miller and Gopalan Nadathur (en)
|
implementations
| |
influenced
| |
influenced by
| |
license
| - GNU General Public License v3 (en)
|
paradigm
| |
released
| |
typing
| |
website
| |
has abstract
| - λProlog ou lambda Prolog est un langage de programmation logique dérivé de Prolog. λProlog est une double extension de Prolog, dans un premier temps, en rajoutant les λ-termes et dans un second temps avec l'ajout de nouveaux connecteurs tels que l'implication et le quantificateur universel.Lambda Prolog introduit également la notion de type simple. (fr)
- λProlog, also written lambda Prolog, is a logic programming language featuring polymorphic typing, modular programming, and higher-order programming. These extensions to Prolog are derived from the higher-order hereditary Harrop formulas used to justify the foundations of λProlog. Higher-order quantification, simply typed λ-terms, and higher-order unification gives λProlog the basic supports needed to capture the λ-tree syntax approach to higher-order abstract syntax, an approach to representing syntax that maps object-level bindings to programming language bindings. Programmers in λProlog need not deal with bound variable names: instead various declarative devices are available to deal with binder scopes and their instantiations. (en)
|
gold:hypernym
| |
prov:wasDerivedFrom
| |
page length (characters) of wiki page
| |
influenced by
| |
license
| |
foaf:isPrimaryTopicOf
| |
is Link from a Wikipage to another Wikipage
of | |
is Wikipage redirect
of | |