Sciweavers

645 search results - page 4 / 129
» Pure patterns type systems
Sort
View
POPL
1991
ACM
15 years 3 months ago
Polymorphic Type Inference and Assignment
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,...
Xavier Leroy, Pierre Weis
ENTCS
2002
129views more  ENTCS 2002»
14 years 11 months ago
Eliminating Proofs from Programs
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
Femke van Raamsdonk, Paula Severi
CSL
2006
Springer
15 years 3 months ago
A Sequent Calculus for Type Theory
Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
ENTCS
2002
77views more  ENTCS 2002»
14 years 11 months ago
Syntactic Type Soundness for HM(X)
The HM(X) framework is a constraint-based type framework with built-in letpolymorphism. This paper establishes purely syntactic type soundness for the framework, treating an exten...
Christian Skalka, François Pottier
PLPV
2012
ACM
13 years 7 months ago
LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs
Functional Reactive Programming (FRP) is a form of reactive programming whose model is pure functions over signals. FRP is often expressed in terms of arrows with loops, which is ...
Alan Jeffrey