Sciweavers

29 search results - page 4 / 6
» Kripke-Style models for typed lambda calculus
Sort
View
FPCA
1989
13 years 11 months ago
A Simple Semantics for ML Polymorphism
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
Atsushi Ohori
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...
FLOPS
2004
Springer
14 years 15 days ago
Semantics of Linear Continuation-Passing in Call-by-Name
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...
Masahito Hasegawa
POPL
1999
ACM
13 years 11 months ago
Type-Safe Linking and Modular Assembly Language
Linking is a low-level task that is usually vaguely specified, if at all, by language definitions. However, the security of web browsers and other extensible systems depends cru...
Neal Glew, J. Gregory Morrisett
ECOOP
2010
Springer
13 years 12 months ago
Recency Types for Analyzing Scripting Languages
Abstract. With the current surge of scripting technologies, large programs are being built with dynamically typed languages. As these programs grow in size, semantics-based tools g...
Phillip Heidegger, Peter Thiemann