منابع مشابه
Typed vs. Untyped Realizability
We study the domain-theoretic semantics of a Church-style typed λ-calculus with constructors, pattern matching and recursion, and show that it is closely related to the semantics of its untyped counterpart. The motivation for this study comes from program extraction from proofs via realizability where one has the choice of extracting typed or untyped terms from proofs. Our result shows that und...
متن کاملMethodological pluralism and pluralism of method
The only uses of this work permitted are private study or research.
متن کاملUntyped XQuery Canonization
XQuery is a powerful language defined by the W3C to query XML documents. Its query functionalities and its expressiveness satisfy the major needs of both the database community and the text and documents community. As an inconvenient, the grammar used to define XQuery is thus very complex and leads to several equivalent query expressions for one same query. This complexity often discourages XQu...
متن کاملUnderstanding untyped λμμ̃ calculus
We prove the confluence of λμμ̃T and λμμ̃Q, two well-behaved subcalculi of the λμμ̃ calculus, closed under call-by-name and call-by-value reduction, respectively. Moreover, we give the interpretation of λμμ̃T in the category of negated domains, and the interpretation of λμμ̃Q in the Kleisli category. To the best of our knowledge this is the first interpretation of untyped λμμ̃ calculus.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mind
سال: 2014
ISSN: 0026-4423,1460-2113
DOI: 10.1093/mind/fzu069