Sciweavers

324 search results - page 10 / 65
» Towards a type theory of contexts
Sort
View
LICS
2010
IEEE
13 years 6 months ago
Equality Is Typable in Semi-full Pure Type Systems
—There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed ...
Vincent Siles, Hugo Herbelin
POPL
2006
ACM
14 years 8 months ago
Hybrid type checking
Traditional static type systems are very effective for verifying basic interface specifications, but are somewhat limited in the kinds specificationsthey support. Dynamically-chec...
Cormac Flanagan
TPHOL
2008
IEEE
14 years 2 months ago
First-Class Type Classes
Abstract. Type Classes have met a large success in Haskell and Isabelle, as a solution for sharing notations by overloading and for specith abstract structures by quantification o...
Matthieu Sozeau, Nicolas Oury
TAP
2008
Springer
153views Hardware» more  TAP 2008»
13 years 7 months ago
Bounded Relational Analysis of Free Data Types
Abstract. In this paper we report on our first experiences using the relational analysis provided by the Alloy tool with the theorem prover KIV in the context of specifications of ...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
CORR
2006
Springer
137views Education» more  CORR 2006»
13 years 7 months ago
Lambda Types on the Lambda Calculus with Abbreviations
for an informal presentation at CIE 2007 [2] is a typed -calculus that pursues the reuse of the term constructions both at the level of types and at the level of contexts, while en...
F. Guidi