128 search results - page 2 / 26 » Type Reconstruction for General Refinement Types |
CONCUR
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. We extend Kobayashi and Sumii’s type system for the deadlock-free π-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii’s type system helps hig...
POPL
1991
ACM
13 years 8 months ago
1991
ACM
We present a new approach to the polymorphic typing of data accepting in-place modification in ML-like languages. This approach is based on restrictions over type generalization,...
POPL
2006
ACM
14 years 5 months ago
2006
ACM
Traditional static type systems are very effective for verifying basic interface specifications, but are somewhat limited in the kinds specificationsthey support. Dynamically-chec...
RECOMB
2005
Springer
14 years 5 months ago
2005
Springer
Reticulation events occur frequently in many types of species. Therefore, to develop accurate methods for reconstructing phylogenetic networks in order to describe evolutionary his...
CORR
2012
Springer
12 years 1 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 ...