291 search results - page 25 / 59 » A Logic for Parametric Polymorphism |
TPHOL
1997
IEEE
15 years 5 months ago
1997
IEEE
Type classes and overloading are shown to be independent concepts that can both be added to simple higher-order logics in the tradition of Church and Gordon, without demanding more...
110
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following p...
SBIA
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. The aim of this paper is to study a family of logics that approximates classical inference, in which every step in the approximation can be decided in polynomial time. Fo...
114
click to vote
APAL
1999
15 years 1 months ago
1999
Coalgebra develops a general theory of transition systems, parametric in a functor T; the functor T specifies the possible one-step behaviors of the system. A fundamental question...
119
click to vote
ICFP
2010
ACM
15 years 2 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...