1313 search results - page 49 / 263 » Generic Universe Types |
CASC
2010
Springer
14 years 10 months ago
2010
Springer
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
115
click to vote
LPAR
2010
Springer
14 years 9 months ago
2010
Springer
We present an explicitly typed lambda calculus "`a la Church" based on the union and intersection types discipline; this system is the counterpart of the standard type a...
101
click to vote
LICS
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
TACS
1997
Springer
15 years 3 months ago
1997
Springer
Abstract. Flexibility of programming and efficiency of program execution are two important features of a programming language. Unfortunately, however, there is an inherent conflict...
103
click to vote
ENTCS
2006
14 years 12 months ago
2006
We develop a domain theory for treating recursive types with respect to contextual equivalence. The principal approach taken here deviates from classical domain theory in that we ...