596 search results - page 46 / 120 » Subtyping Recursive Types |
108
click to vote
ICFP
2004
ACM
16 years 1 months ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
136
click to vote
TYPES
2000
Springer
15 years 5 months ago
2000
Springer
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are co...
109
click to vote
PLDI
2010
ACM
15 years 10 months ago
2010
ACM
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
144
click to vote
CORR
2012
Springer
13 years 9 months ago
2012
Springer
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
106
click to vote
SIGSOFT
2000
ACM
15 years 5 months ago
2000
ACM
We describe an extension to the Java programming language that supports static conformance checking and dynamic debugging of object "protocols," i.e., sequencing constra...