A Framework for Defining Logical Frameworks

In this paper, we introduce a General Logical Framework, called GLF, for defining Logical Frameworks, based on dependent types, in the style of the well known Edinburgh Logical Framework LF. The framework GLF features a generalized form of lambda abstraction where β-reductions fire provided the argu...

Full description

Saved in:

Bibliographic Details
Published in:	Electronic notes in theoretical computer science Vol. 172; pp. 399 - 436
Main Authors:	Honsell, Furio, Lenisa, Marina, Liquori, Luigi
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.04.2007 Elsevier
Series:	In Computation, Meaning and Logic. ENTCS, Special issue, dedicated to Gordon D. Plotkin, on the occasion of his 60th birthday
Subjects:	Computation and Language Computer Science Dependent-type systems Lambda calculus Logic in Computer Science Logical Framework Logics Pattern matching Logics Logical Framework Lambda calculus Dependent-type systems Pattern matching Lambda calculus and related systems Language Classifications: Applicative (functional) languages Constraint and logic languages Category Mechanical theorem proving Logic and constraint programming Formal Definitions and Theory: Syntax and Semantics
ISSN:	1571-0661, 1571-0661
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!