Comparing models of the intensional typed -calculus

By Hoofman R.  

Theoretical Computer Science, Vol. 166, Iss. 1, 1996-10 ,pp. : 83-99

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

A typed -calculus for proving-by-example and bottom-up generalization procedure

By Hagiya M.  

Theoretical Computer Science, Vol. 137, Iss. 1, 1995-01 ,pp. : 3-23

Elsevier

Access to resources Recommend Favorite

Bisimulation in Untyped Lambda Calculus - Bohm Trees and Bisimulation up to Context

By Lassen S.B.  

Electronic Notes in Theoretical Computer Science, Vol. 20, Iss. 1, 2004-01 ,pp. : 1-29

Elsevier

Access to resources Recommend Favorite