λ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.

Property Value
dbo: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)
dbo:influencedBy
dbo:license
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 4723511 (xsd:integer)
dbo:wikiPageLength
  • 5194 (xsd:integer)
dbo:wikiPageRevisionID
  • 972334605 (xsd:integer)
dbo:wikiPageWikiLink
dbp:designers
  • Dale Miller and Gopalan Nadathur (en)
dbp:implementations
  • Teyjus, ELPI (en)
dbp:influenced
  • Makam (en)
dbp:influencedBy
dbp:license
  • GNU General Public License v3 (en)
dbp:name
  • λProlog (en)
dbp:paradigm
dbp:released
  • 1987 (xsd:integer)
dbp:typing
  • strongly typed (en)
dbp:website
dbp:wikiPageUsesTemplate
dct:subject
rdf:type
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)
rdfs:label
  • ΛProlog (fr)
  • ΛProlog (en)
owl:sameAs
prov:wasDerivedFrom
foaf:homepage
foaf:isPrimaryTopicOf
foaf:name
  • λProlog (en)
foaf:page
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of