<--- Back to Details
First PageDocument Content
Lambda calculus / Type theory / Logic programming / Formal methods / Unification / Higher-order abstract syntax / Function / Hindley–Milner / Free variables and bound variables / Mathematics / Software engineering / Theoretical computer science
Date: 2004-10-28 08:33:38
Lambda calculus
Type theory
Logic programming
Formal methods
Unification
Higher-order abstract syntax
Function
Hindley–Milner
Free variables and bound variables
Mathematics
Software engineering
Theoretical computer science

αProlog User’s Guide & Language Reference Version 0.3 DRAFT

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Download Document from Source Website

File Size: 137,23 KB

Share Document on Facebook

Similar Documents

Multiplexing / T-carrier / Schedule

SYNT Workshop - SyGuS Comp’17 SaturdayE3Solver: Decision Tree Unification by Enumeration

DocID: 1xVIR - View Document

System Science of Virtual Reality: Toward the Unification of Empirical and Subjective Science John Ringland

DocID: 1vn9o - View Document

THE ROTTERDAM RULES: CHANGES FROM COGSA Copyright 2010, Charles M. Davis 1 In 1924, when the Hague Rules (The International Convention for the Unification of Certain Rules Relating to Bills of Lading, August 25, 1924) we

DocID: 1vfb7 - View Document

The GEMS (Gravity ElectroMagnetism Super) Unification Theory and The NASA JSC EM Thruster J.E. Brandenburg Morningstar Applied Physics LLC

DocID: 1v4yq - View Document

Eliminating Timing Leaks by Unification (Extended Abstract) Boris K¨opf and Heiko Mantel ETH Z¨ urich, Switzerland {boris.koepf,heiko.mantel}@inf.ethz.ch

DocID: 1uY7L - View Document