Sciweavers

640 search results - page 11 / 128
» Logical types for untyped languages
Sort
View
PLDI
1998
ACM
13 years 12 months ago
Units: Cool Modules for HOT Languages
A module system ought to enable assembly-line programming using separate compilation and an expressive linking language. Separate compilation allows programmers to develop parts o...
Matthew Flatt, Matthias Felleisen
PLPV
2012
ACM
12 years 3 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
POPL
1997
ACM
13 years 12 months ago
Behavioral Equivalence in the Polymorphic Pi-calculus
We investigateparametric polymorphism in message-basedconcurrentprogramming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambdacal...
Benjamin C. Pierce, Davide Sangiorgi
ENTCS
2006
153views more  ENTCS 2006»
13 years 7 months ago
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
Lars Birkedal, Rasmus Ejlers Møgelberg, Ras...