Sciweavers

95 search results - page 3 / 19
» Static type inference for Ruby
Sort
View
PLDI
2010
ACM
14 years 3 months ago
Ur: Statically-Typed Metaprogramming with Type-Level Record Computation
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
Adam Chlipala
ICFP
2004
ACM
14 years 6 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard
ENTCS
2010
133views more  ENTCS 2010»
13 years 1 months ago
Inference of Session Types From Control Flow
This is a study of a technique for deriving the session type of a program written in a statically typed imperative language from its control flow. We impose on our unlabelled sess...
Peter Collingbourne, Paul H. J. Kelly
ICFP
2003
ACM
14 years 6 months ago
A static type system for JVM access control
This paper presents a static type system for JAVA Virtual Machine (JVM) code that enforces an access control mechanism similar to the one found, for example, in a JAVA implementat...
Tomoyuki Higuchi, Atsushi Ohori
DLS
2009
150views Languages» more  DLS 2009»
13 years 4 months ago
Fast type reconstruction for dynamically typed programming languages
Type inference and type reconstruction derive static types for program elements that have no static type associated with them. They have a wide range of usage, such as helping to ...
Frédéric Pluquet, Antoine Marot, Roe...