Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Lightweight Lemmas in lProlog Andrew W. Appel
 

Summary: Lightweight Lemmas in lProlog
Andrew W. Appel
Bell Laboratories and Princeton University
Amy P. Felty
Bell Laboratories
May 14, 1999
Abstract
lProlog is known to be well­suited for expressing and
implementing logics and inference systems. We show
that lemmas and definitions in such logics can be imple­
mented with a great economy of expression. The terms of
the meta­language (lProlog) can be used to express the
statement of a lemma, and the type checking of the meta­
language can directly implement the type checking of the
lemma. The ML­style prenex polymorphism of lProlog
allows easy expression of polymorphic inference rules,
but a more general polymorphism would be necessary to
express polymorphic lemmas directly. We discuss both
the Terzo and Teyjus implementations of lProlog as well
as related systems such as Elf.

  

Source: Appel, Andrew W. - Department of Computer Science, Princeton University

 

Collections: Computer Technologies and Information Sciences