Sciweavers

267 search results - page 31 / 54
» Formal Parametric Polymorphism
Sort
View
POPL
1998
ACM
15 years 6 months ago
Local Type Inference
constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate o...
Benjamin C. Pierce, David N. Turner
POPL
2007
ACM
16 years 2 months ago
Towards a mechanized metatheory of standard ML
We present an internal language with equivalent expressive power to Standard ML, and discuss its formalization in LF and the machine-checked verification of its type safety in Twe...
Daniel K. Lee, Karl Crary, Robert Harper
SAS
1993
Springer
139views Formal Methods» more  SAS 1993»
15 years 6 months ago
Compiling FX on the CM-2
Type and effect systems provide a safe and effective means of programming high-performance parallel computers with a high-level language that integrates both functional and impe...
Jean-Pierre Talpin, Pierre Jouvelot
SAS
1994
Springer
105views Formal Methods» more  SAS 1994»
15 years 6 months ago
Efficient Strictness Analysis of Haskell
Strictness analysis has been a living field of investigation since Mycroft's original work in 1980, and is getting increasingly significant with the still wider use of lazy fu...
Kristian Damm Jensen, Peter Hjæresen, Mads R...
POPL
2006
ACM
16 years 2 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