Infinitary lambda calculus and discrimination of Berarducci trees

Author： Dezani-Ciancaglini M.   Severi P.   de Vries F-J.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.298, Iss.2, 2003-04, pp. : 275-302

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Infinitary lambda calculus

By Kennaway J.R.   Klop J.W.   Sleep M.R.   de Vries F.J.  

Theoretical Computer Science, Vol. 175, Iss. 1, 1997-03 ,pp. : 93-125

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

Polymorphic lambda calculus and subtyping

By Fiech  

Theoretical Computer Science, Vol. 278, Iss. 1, 2002-05 ,pp. : 111-140

Elsevier

Access to resources Recommend Favorite

The differential lambda-calculus

By Ehrhard T.   Regnier L.  

Theoretical Computer Science, Vol. 309, Iss. 1, 2003-12 ,pp. : 1-41

Elsevier

Access to resources Recommend Favorite

Matching for the lambda calculus of objects

By Bono V.   Bugliesi M.  

Theoretical Computer Science, Vol. 212, Iss. 1, 1999-02 ,pp. : 101-140

Elsevier

Access to resources Recommend Favorite