Sciweavers

267 search results - page 42 / 54
» Formal Parametric Polymorphism
Sort
View
POPL
1999
ACM
15 years 4 months ago
JFlow: Practical Mostly-Static Information Flow Control
A promising technique for protecting privacy and integrity of sensitive data is to statically check information flow within programs that manipulate the data. While previous work...
Andrew C. Myers
ICFP
1997
ACM
15 years 3 months ago
Foundations for the Implementation of Higher-Order Subtyping
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
Karl Crary
JFP
2008
97views more  JFP 2008»
14 years 10 months ago
HM(X) type inference is CLP(X) solving
The HM(X) system is a generalization of the Hindley/Milner system parameterized in the constraint domain X. Type inference is performed by generating constraints out of the progra...
Martin Sulzmann, Peter J. Stuckey
SCP
2011
255views Communications» more  SCP 2011»
14 years 6 months ago
Map fusion for nested datatypes in intensional type theory
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
Ralph Matthes
ESOP
2005
Springer
15 years 5 months ago
A Type System Equivalent to a Model Checker
ite-state abstraction scheme such as predicate abstraction. The type system, which is also parametric, type checks exactly those programs that are accepted by the model checker. It...
Mayur Naik, Jens Palsberg