17 search results - page 2 / 4 » Cartesian Programming: The TransLucid Programming Language |
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
We show that strictly positive inductive types, constructed from polynomial functors, constant exponentiation and arbitrarily nested inductive types exist in any Martin-L¨of categ...
ECOOP
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Precise type information is invaluable for analysis and optimization of object-oriented programs. Some forms of polymorphism found in object-oriented languages pose signi...
ICFP
2005
ACM
14 years 4 months ago
2005
ACM
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
IFIP
2010
Springer
13 years 9 months ago
2010
Springer
In this work it is shown the representation of 3D object shape acquired from grasp exploration. Electromagnetic motion tracking sensors are used on the fingers for object contour f...
ICALP
2000
Springer
13 years 8 months ago
2000
Springer
Lax logical relations are a categorical generalisation of logical relations; though they preserve product types, they need not preserve exponential types. But, like logical relatio...