Veronica Gaspes. Formal Proofs of Combinatorial Completeness. In To appear in the informal proceedings from the logical framework workshop at Bastad, June 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....have therefore for the moment no restrictions at all. This means that the correctness of a de nition is the user s responsibility. Among the examples developed in ALF, we can mention a proof that Ackermann s function is not primitive recursive [38] functional completeness of combinatorial logic [16], Tait s normalization proof for G#del s T [17] the fundamental theorem of arithmetic [40] a constructive version of Ramsey s theorem [15] and a semantical analysis of simply typed lambda calculus with explicit substitution [7] ....

Veronica Gaspes. Formal Proofs of Combinatorial Completeness. In To appear in the informal proceedings from the logical framework workshop at B#stad, June 1992. Martin-L#f's Type Theory 37

....multiset of primes. ffl K.V.S. Prasad and Karlis Cerans have made experiments in expressing proofs about various process calculi. ffl Michael Hedberg constructs a category of semilattices and approximable mappings and show that it is cartesian closed and wellpointed. ffl Veronica Gaspes showed [9] functional completeness of combinatorial logic, i.e. that every function can be compiled into an expression only involving the basic combinators S, K and I. ffl Daniel Fridlender presented formal proofs of Higman s lemma and of an intuitionistic version of Ramsey s theorem. 8] ffl Peter ....

Veronica Gaspes. Formal Proofs of Combinatorial Completeness. In To appear in the informal proceedings from the logical framework workshop at Bastad, June 1992.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC