Sciweavers

FP
1995
156views Formal Methods» more  FP 1995»
13 years 8 months ago
Type Reconstruction for SCI
We present a type reconstruction algorithm for SCIR 10], a type system for a language with syntactic control of interference. SCIR guarantees that terms of passive type do not cau...
Howard Huang, Uday S. Reddy
ESOP
2007
Springer
13 years 8 months ago
Type Reconstruction for General Refinement Types
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...
Kenneth W. Knowles, Cormac Flanagan
PLDI
1989
ACM
13 years 9 months ago
Type Reconstruction with First-Class Polymorphic Values
We present the rst type reconstruction system which combines the implicit typing of ML with the full power of the explicitly typed second-order polymorphic lambda calculus. The sy...
James O'Toole, David K. Gifford
CONCUR
2000
Springer
13 years 9 months ago
An Implicitly-Typed Deadlock-Free Process Calculus
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...
Naoki Kobayashi, Shin Saito, Eijiro Sumii
PPDP
2001
Springer
13 years 9 months ago
Polymorphic Directional Types for Logic Programming
In this paper we present a new type system for logic programs. Our system combines ideas of the classical polymorphic, but not very precise, system due to Mycroft and O'Keefe...
Pawel Rychlikowski, Tomasz Truderung