1982 search results - page 44 / 397 » Parametricity and dependent types |
110
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
ICFP
2000
ACM
15 years 2 months ago
2000
ACM
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
PPDP
2007
Springer
15 years 4 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
POPL
2003
ACM
15 years 3 months ago
2003
ACM
First-class continuations are a powerful computational effect, allowing the programmer to express any form of jumping. Types and effect systems can be used to reason about contin...
SOFSEM
2009
Springer
15 years 2 months ago
2009
Springer
In this paper we define partial order semantics of types of nets. Types of nets are a parametric definition of Petri nets originally developed for a general presentation of the s...