1636 search results - page 264 / 328 » Type-Theoretic Functional Semantics |
209
click to vote
POPL
2006
ACM
16 years 6 days ago
2006
ACM
In PLT Scheme, programs consist of modules with contracts. The latter describe the inputs and outputs of functions and objects via predicates. A run-time system enforces these pre...
186
click to vote
POPL
2006
ACM
16 years 6 days ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
CADE
2006
Springer
16 years 6 days ago
2006
Springer
The HOL Light prover is based on a logical kernel consisting of about 400 lines of mostly functional OCaml, whose complete formal verification seems to be quite feasible. We would ...
112
click to vote
SIGMOD
2003
ACM
16 years 1 days ago
2003
ACM
The W3C XQuery language recommendation, based on a hierarchical and ordered document model, supports a wide variety of constructs and use cases. There is a diversity of approaches...
108
click to vote
ICFP
2008
ACM
15 years 12 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...