194 search results - page 28 / 39 » An Introduction to the Lambda Calculus |
FMOODS
2007
13 years 9 months ago
2007
In this paper we present a formalization of Abadi’s and Cardelli’s theory of objects in the interactive theorem prover Isabelle/HOL. Our motivation is to build a mechanized HOL...
DOCENG
2003
ACM
14 years 1 months ago
2003
ACM
We introduce a lazy XSLT interpreter that provides random access to the transformation result. This allows efficient pipelining of transformation sequences. Nodes of the result tr...
POPL
1999
ACM
14 years 2 days ago
1999
ACM
Linking is a low-level task that is usually vaguely specified, if at all, by language definitions. However, the security of web browsers and other extensible systems depends cru...
PPDP
2010
Springer
13 years 6 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
CSL
1999
Springer
14 years 1 days ago
1999
Springer
This paper gives the first proof that the subtyping relation of a higherorder lambda calculus, Fω ≤, is anti-symmetric, establishing in the process that the subtyping relation...