3319 search results - page 60 / 664 » Type Theoretical Databases |
116
click to vote
ICFP
2007
ACM
16 years 1 months ago
2007
ACM
The MLF type system by Le Botlan and R?emy (2003) is a natural extension of Hindley-Milner type inference that supports full firstclass polymorphism, where types can be of higher-...
ESOP
2007
Springer
15 years 7 months ago
2007
Springer
When students first learn programming, they often rely on a simple operational model of a program’s behavior to explain how particular features work. Because such models build o...
111
Voted
MST
2007
15 years 16 days ago
2007
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
119
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state aut...
92
Voted
CIE
2005
Springer
15 years 6 months ago
2005
Springer
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...