660 search results - page 41 / 132 » The Implicit Calculus of Constructions |
147
click to vote
ESOP
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. Languages for intensional type analysis permit ad-hoc polymorphism, or run-time analysis of types. However, such languages require complex, specialized constructs to supp...
130
click to vote
IEEEPACT
2000
IEEE
15 years 9 months ago
2000
IEEE
ÐThis paper presents a multithreaded abstract machine for the TyCO process calculus. We argue that process calculi provide a powerful framework to reason about fine-grained parall...
142
click to vote
LICS
2000
IEEE
15 years 9 months ago
2000
IEEE
While Game Semantics has been remarkably successful at g, often in a fully abstract manner, a wide range of features of programming languages, there has to date been no attempt at...
129
click to vote
APAL
2010
15 years 5 months ago
2010
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the meaning of the new notion and its a...
138
click to vote
APAL
2008
15 years 5 months ago
2008
Building on previous work by Coquand and Spiwack [8] we construct a strict domaintheoretic model for the untyped -calculus with pattern matching and term rewriting which has the p...