291 search results - page 28 / 59 » A Logic for Parametric Polymorphism |
125
click to vote
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
107
click to vote
LICS
2009
IEEE
15 years 8 months ago
2009
IEEE
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...
130
Voted
CORR
2004
Springer
15 years 1 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
122
Voted
TCS
2011
14 years 8 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
125
click to vote
ICFP
2006
ACM
16 years 1 months ago
2006
ACM
Datatype-generic programming (DGP) is the next step beyond abstracting over types using parametric polymorphism, which is often called "genericity" in object-oriented la...