Sciweavers

1286 search results - page 2 / 258
» From System F to Typed Assembly Language
Sort
View
POPL
2006
ACM
16 years 3 months ago
Frame rules from answer types for code pointers
We define a type system, which may also be considered as a simple Hoare logic, for a fragment of an assembly language that deals with code pointers and jumps. The typing is aimed ...
Hayo Thielecke
TLDI
2003
ACM
15 years 8 months ago
The logical approach to stack typing
We develop a logic for reasoning about adjacency and separation of memory blocks, as well as aliasing of pointers. We provide a memory model for our logic and present a sound set ...
Amal J. Ahmed, David Walker
141
Voted
ICFP
2008
ACM
16 years 3 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
TIC
2000
Springer
116views System Software» more  TIC 2000»
15 years 6 months ago
Sharing in Typed Module Assembly Language
Abstract. There is a growing need to provide low-overhead softwarebased protection mechanisms to protect against malicious or untrusted code. Type-based approaches such as proof-ca...
Dominic Duggan
ICFP
2005
ACM
16 years 3 months ago
PolyAML: a polymorphic aspect-oriented functional programming language
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
Daniel S. Dantas, David Walker, Geoffrey Washburn,...