Sciweavers

360 search results - page 29 / 72
» Dependently Typed Programming in Agda
Sort
View
ICFP
2001
ACM
14 years 7 months ago
Functioning without Closure: Type-Safe Customized Function Representations for Standard ML
The CIL compiler for core Standard ML compiles whole ML programs using a novel typed intermediate language that supports the generation of type-safe customized data representation...
Allyn Dimock, Ian Westmacott, Robert Muller, Frank...
POPL
2006
ACM
14 years 8 months ago
The next 700 data description languages
In the spirit of Landin, we present a calculus of dependent types to serve as the semantic foundation for a family of languages called data description languages. Such languages, ...
Kathleen Fisher, Yitzhak Mandelbaum, David Walker
HICSS
2003
IEEE
184views Biometrics» more  HICSS 2003»
14 years 29 days ago
Content Based File Type Detection Algorithms
Identifying the true type of a computer file can be a difficult problem. Previous methods of file type recognition include fixed file extensions, fixed “magic numbers” stored ...
Mason McDaniel, Mohammad Hossain Heydari
TACS
1997
Springer
13 years 11 months ago
Optimal Representations of Polymorphic Types with Subtyping (Extended Abstract)
d Abstract) Alexander Aiken1 and Edward L. Wimmers2 and Jens Palsberg3 1 EECS Department, University of California at Berkeley, Berkeley, CA 94720-1776. 2 IBM Almaden Research Cent...
Alexander Aiken, Edward L. Wimmers, Jens Palsberg
ICFP
2012
ACM
11 years 10 months ago
Transporting functions across ornaments
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
Pierre-Évariste Dagand, Conor McBride