596 search results - page 43 / 120 » Subtyping Recursive Types |
104
click to vote
POPL
2010
ACM
15 years 10 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
FPL
2005
Springer
15 years 6 months ago
2005
Springer
The paper analyses and compares alternative iterative and recursive implementations of FPGA circuits for various problems. Two types of recursive calls have been examined, namely ...
103
click to vote
HASKELL
2006
ACM
15 years 7 months ago
2006
ACM
In this paper we address the lack of extensibility of the exception type in Haskell. We propose a lightweight solution involving the use of existential types and the Typeable clas...
104
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
This paper proposes a type-and-effect system called Teq, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambd...
109
click to vote
AAECC
2007
Springer
15 years 1 months ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...