Sciweavers

1286 search results - page 26 / 258
» From System F to Typed Assembly Language
Sort
View
PLDI
2010
ACM
14 years 5 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
ATAL
2005
Springer
14 years 1 months ago
An agent-based approach for managing symbiotic simulation of semiconductor assembly and test operation
The rapid changing business environment of high-tech asset intensive enterprises such as semiconductor manufacturing constantly drives production managers to look for better solut...
Malcolm Yoke-Hean Low, Kong Wei Lye, Peter Lenderm...
ICFP
2004
ACM
14 years 7 months ago
Translating dependency into parametricity
Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and fu...
Stephen Tse, Steve Zdancewic
TLDI
2009
ACM
111views Formal Methods» more  TLDI 2009»
14 years 4 months ago
A generic type-and-effect system
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
Daniel Marino, Todd D. Millstein
ICFP
2010
ACM
13 years 8 months ago
Parametricity and dependent types
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
Jean-Philippe Bernardy, Patrik Jansson, Ross Pater...