Sciweavers

704 search results - page 18 / 141
» A Note on Typing Feature Structures
Sort
View
POPL
1997
ACM
13 years 11 months ago
First-class Polymorphism with Type Inference
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
Mark P. Jones
CAV
2008
Springer
130views Hardware» more  CAV 2008»
13 years 8 months ago
A Hybrid Type System for Lock-Freedom of Mobile Processes
We propose a type system for lock-freedom in the -calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it...
Naoki Kobayashi, Davide Sangiorgi
TCS
2008
13 years 6 months ago
Integration of a security type system into a program logic
Type systems and program logics are often conceived to be at opposing ends of the spectrum of formal software analyses. In this paper we show that a flow-sensitive type system ensu...
Reiner Hähnle, Jing Pan, Philipp Rümmer,...
POPL
2006
ACM
14 years 7 months ago
A polymorphic modal type system for lisp-like multi-staged languages
This article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp's staging constructs (the quasi-...
Ik-Soon Kim, Kwangkeun Yi, Cristiano Calcagno
PPDP
2005
Springer
14 years 6 days ago
Isolation-only transactions by typing and versioning
In this paper we design a language and runtime support for isolation-only, multithreaded transactions (called tasks). Tasks allow isolation to be declared instead of having to be ...
Pawel T. Wojciechowski