3001 search results - page 42 / 601 » Recursive type generativity |
JSYML
2010
14 years 6 months ago
2010
We prove that the (non-intuitionistic) law of the double negation shift has a bounded functional interpretation with bar recursive functionals of finite type. As an application, we...
100
click to vote
ISAAC
2010
Springer
14 years 9 months ago
2010
Springer
We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such pr...
APLAS
2003
ACM
15 years 5 months ago
2003
ACM
This paper introduces a Standard ML realization of the scrap-yourboilerplate generic-programming mechanism (first introduced by Simon Peyton Jones and Ralf Lämmel), which gives ...
ICFP
2004
ACM
15 years 11 months ago
2004
ACM
d Abstract) Dario Colazzo1 , Giorgio Ghelli2 , Paolo Manghi2 , and Carlo Sartiani2 1 LRI - Universit?e Paris Sud 2 Dipartimento di Informatica - Universit`a di Pisa If a subexpress...
130
click to vote
ACL2
2006
ACM
15 years 5 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...