564 search results - page 60 / 113 » Dependent types and program equivalence |
ICFP
2010
ACM
13 years 10 months ago
2010
ACM
We present a closed dependent type theory whose inductive types are given not by a scheme for generative declarations, but by encoding in a universe. Each inductive datatype arise...
PLDI
2011
ACM
12 years 12 months ago
2011
ACM
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
ML
2006
ACM
14 years 3 months ago
2006
ACM
We present an extension to Standard ML, called SMLSC, to support separate compilation. The system gives meaning to individual program fragments, called units. Units may depend on ...
POPL
1990
ACM
14 years 1 months ago
1990
ACM
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
POPL
2010
ACM
14 years 6 months ago
2010
ACM
Abstract. The blame calculus of Wadler and Findler gives a high-level semantics to casts in higher-order languages. The coercion calculus of Henglein, on the other hand, provides a...