3713 search results - page 292 / 743 » Constructing a Calculus of Programs |
135
click to vote
APLAS
2007
ACM
15 years 8 months ago
2007
ACM
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
140
click to vote
ESOP
2009
Springer
15 years 8 months ago
2009
Springer
Ownership types characterize the topology of objects in the heap, through a characterization of the context to which an object belongs. They have been used to support reasoning, me...
164
click to vote
POPL
1991
ACM
15 years 7 months ago
1991
ACM
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The two fundamental questions here are whether two (recursive) types are in the su...
122
click to vote
ECOOP
2008
Springer
15 years 6 months ago
2008
Springer
Nominal and structural subtyping each have their own strengths and weaknesses. Nominal subtyping allows programmers to explicitly express design intent, and, when types are associa...
132
click to vote
FLOPS
2008
Springer
15 years 5 months ago
2008
Springer
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...