About: ?Prolog     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:Language106282651, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2F%CE%9BProlog

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

AttributesValues
rdf:type
rdfs:label
  • ΛProlog
  • ΛProlog
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.
  • λ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.
foaf:name
  • λProlog
foaf:homepage
name
  • λProlog
foaf:page
foaf:isPrimaryTopicOf
dct: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
implementations
  • Teyjus, ELPI
influenced
  • Makam
influenced by
license
  • GNU General Public License v3
paradigm
released
typing
  • strongly typed
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.
  • λ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.
influenced by
license
prov:wasDerivedFrom
page length (characters) of wiki page
is foaf:primaryTopic of
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
Faceted Search & Find service v1.17_git51 as of Sep 16 2020


Alternative Linked Data Documents: PivotViewer | iSPARQL | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3319 as of Dec 29 2020, on Linux (x86_64-centos_6-linux-glibc2.12), Single-Server Edition (61 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2021 OpenLink Software