The CAML Reference Manual, Version 2.6. Projet Formel, INRIA-ENS (1989)

by Pierre Weis
Venue:21 5.2.1 The System : : : : : : : : : : : : : : : : : : : : : : : : : : : : 21 5.2.2 The Signature \Sigma v : : : : : : : : : : : : : : : : : : : : : : : : 22 5.3 The Lambda I Calculus : : : : : : : : : : : : : : : : : : : : : : : : : : 23 5.3.1 The Syste
Add To MetaCart
Results 1 - 1 of 1

Using Typed Lambda Calculus to Implement Formal Systems on a Machine

by Arnon Avron, Furio Honsell, Ian A. Mason, Robert Pollack - Journal of Automated Reasoning , 1992
"... this paper and the LF. In particular the idea of having an operator T : Prop ! Type appears already in De Bruijn's earlier work, as does the idea of having several judgements. The paper [24] describes the basic features of the LF. In this paper we are going to provide a broader illustration of its a ..."
Abstract - Cited by 78 (13 self) - Add to MetaCart
this paper and the LF. In particular the idea of having an operator T : Prop ! Type appears already in De Bruijn's earlier work, as does the idea of having several judgements. The paper [24] describes the basic features of the LF. In this paper we are going to provide a broader illustration of its applicability and discuss to what extent it is successful. The analysis (of the formal presentation) of a system carried out through encoding often illuminates the system itself. This paper will also deal with this phenomenon.