Sciweavers

660 search results - page 41 / 132
» The Implicit Calculus of Constructions
Sort
View
ESOP
2001
Springer
14 years 2 months ago
Encoding Intensional Type Analysis
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...
Stephanie Weirich
IEEEPACT
2000
IEEE
14 years 2 months ago
Fine Grained Multithreading with Process Calculi
Ð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...
Luís M. B. Lopes, Fernando M. A. Silva, Vas...
LICS
2000
IEEE
14 years 2 months ago
Game Semantics and Subtyping
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...
Juliusz Chroboczek
APAL
2010
129views more  APAL 2010»
13 years 10 months ago
Kripke models for classical logic
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...
Danko Ilik, Gyesik Lee, Hugo Herbelin
APAL
2008
112views more  APAL 2008»
13 years 10 months ago
A domain model characterising strong normalisation
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...
Ulrich Berger