Unification of Simply Typed Lambda-Terms as Logic Programming

LFCS, Department of Computer Science, University of Edinburgh (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A Logic Programming Language with Lambda-abstraction, Function Variables, and Simple Unification.Dale Miller - 1991 - LFCS, Department of Computer Science, University of Edinburgh.
Ordinals and ordinal functions representable in the simply typed lambda calculus.N. Danner - 1999 - Annals of Pure and Applied Logic 97 (1-3):179-201.
Introduction to Combinators and (Lambda) Calculus.J. Roger Hindley - 1986 - New York: Cambridge University Press. Edited by J. P. Seldin.
Domains and lambda-calculi.Roberto M. Amadio - 1998 - New York: Cambridge University Press. Edited by P.-L. Curien.
Typed logics with states.J. van Eijck - 1997 - Logic Journal of the IGPL 5 (5):623-645.
Inductive types and type constraints in the second-order lambda calculus.Nax Paul Mendler - 1991 - Annals of Pure and Applied Logic 51 (1-2):159-172.
Kripke-style models for typed lambda calculus.John C. Mitchell & Eugenio Moggi - 1991 - Annals of Pure and Applied Logic 51 (1-2):99-124.

Analytics

Added to PP
2015-02-03

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references