596 search results - page 35 / 120 » Subtyping Recursive Types |
123
click to vote
BIRTHDAY
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
180
click to vote
FPCA
1995
15 years 4 months ago
1995
Fold and unfold are general purpose functionals for processing and constructing lists. By using the categorical approach of modelling recursive datatypes as fixed points of funct...
118
click to vote
IFL
2003
Springer
15 years 6 months ago
2003
Springer
Abstract This paper presents a type-based analysis for inferring sizeand cost-equations for recursive, higher-order and polymorphic functional programs without requiring user annot...
103
click to vote
ECOOP
1998
Springer
15 years 5 months ago
1998
Springer
One of the price tags attached to the blessings that OO brings about is a drop in efficiency due to dynamic method dispatch. Much research effort is being spent on the problem of e...
103
click to vote
CSL
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. In this paper we show how to extend a constructive type theory with a principle that captures the spirit of Markov’s principle from constructive recursive mathematics. ...