Sciweavers

31686 search results - page 226 / 6338
» Resource typing in Guru
Sort
View
FLOPS
2008
Springer
13 years 12 months ago
Undoing Dynamic Typing (Declarative Pearl)
We propose undoable versions of the projection operations used when programs written in higher-order statically-typed languages interoperate with dynamically typed ones, localizing...
Nick Benton
LFP
1992
90views more  LFP 1992»
13 years 11 months ago
Polymorphic Type Reconstruction for Garbage Collection Without Tags
Several papers ([Appe189],[Goldberg9 1]) have recently claimed that garbage collection can be performed on untagged data in the presence of ML-style type polymorphism. They rely o...
Benjamin Goldberg, Michael Gloger
APAL
2008
79views more  APAL 2008»
13 years 10 months ago
Parameter-free polymorphic types
Consider the following restriction of the polymorphically typed lambda calculus ("System F"). All quantifications are parameter free. In other words, in every universal ...
Klaus Aehlig
TCS
2010
13 years 5 months ago
An exact correspondence between a typed pi-calculus and polarised proof-nets
This paper presents an exact correspondence in typing and dynamics between polarised linear logic and a typed -calculus based on IO-typing. The respective incremental constraints,...
Kohei Honda, Olivier Laurent
CAV
2012
Springer
257views Hardware» more  CAV 2012»
12 years 25 days ago
CSolve: Verifying C with Liquid Types
We present CSolve, an automated verifier for C programs based on Liquid Type inference. We show how CSolve verifies memory safety through an example and describe its architecture...
Patrick Maxim Rondon, Alexander Bakst, Ming Kawagu...