596 search results - page 59 / 120 » Subtyping Recursive Types |
115
click to vote
ISAAC
2010
Springer
14 years 11 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...
ICFP
2004
ACM
16 years 1 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...
147
click to vote
ACL2
2006
ACM
15 years 7 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 ...
106
click to vote
TAP
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. In this paper we report on our first experiences using the relational analysis provided by the Alloy tool with the theorem prover KIV in the context of specifications of ...
113
click to vote
EACL
1993
ACL Anthology
15 years 2 months ago
1993
ACL Anthology
The formal architecture of Lexical Functional Grammar offers a particular formal device, the structural correspondence, for modularizing the mapping between the surface forms of a...