Author： Nishizaki S-Y.
Publisher： Springer Publishing Company
ISSN： 1388-3690
Source： LISP and Symbolic Computation, Vol.13, Iss.3, 2000-09, pp. : 239-278
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Tractability of cut-free Gentzen type propositional calculus with permutation inference
By Arai N.H.
Theoretical Computer Science, Vol. 170, Iss. 1, 1996-12 ,pp. :
Access to resources
Recommend
Polymorphic lambda calculus and subtyping
By Fiech
Theoretical Computer Science, Vol. 278, Iss. 1, 2002-05 ,pp. :
Type inference for recursively constrained types and its application to OOP
By Eifrig J. Smith S. Trifonov V.
Theoretical Computer Science, Vol. 152, Iss. 2, 1995-12 ,pp. :
By Turner
Theoretical Computer Science, Vol. 266, Iss. 1, 2001-09 ,pp. :