A treatment of higher-order features in logic programming

DOI10.1017/S1471068404002297zbMath1095.68015OpenAlexW2142995137MaRDI QIDQ3370572

Gopalan Nadathur

Publication date: 8 February 2006

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1471068404002297

zbMATH Keywords

lambda calculushigher-order unificationcompilation processabstract machine compilationintensional higher-order logic programminglambda-PROLOG implementationpolymorphic typing procedureTeyjus PROLOGWarren Abstract Machine instructions

Mathematics Subject Classification ID

Logic programming (68N17) Combinatory logic and lambda calculus (03B40)

Related Items (1)

A Survey of the Proof-Theoretic Foundations of Logic Programming

Uses Software

• Twelf

This page was built for publication: A treatment of higher-order features in logic programming