Polarized proof-nets and -calculus

By Laurent O.  

Theoretical Computer Science, Vol. 290, Iss. 1, 2003-01 ,pp. : 161-188

Elsevier

Access to resources Recommend Favorite

Proof by computation in the Coq system

By Oostdijk M.   Geuvers H.  

Theoretical Computer Science, Vol. 272, Iss. 1, 2002-02 ,pp. : 293-314

Elsevier

Access to resources Recommend Favorite

Towards a proof theory of rewriting: the simply typed 2 -calculus

By Hilken B.P.  

Theoretical Computer Science, Vol. 170, Iss. 1, 1996-12 ,pp. : 407-444

Elsevier

Access to resources Recommend Favorite

A Formalised Proof of the Soundness and Completeness of a Simply Typed Lambda-Calculus with Explicit Substitutions

By Coquand C.  

LISP and Symbolic Computation, Vol. 15, Iss. 1, 2002-03 ,pp. : 57-90

Springer Publishing Company

Access to resources Recommend Favorite

The calculus of constructions as a framework for proof search with set variable instantiation

By Felty A.  

Theoretical Computer Science, Vol. 232, Iss. 1, 2000-02 ,pp. : 187-229

Elsevier

Access to resources Recommend Favorite