Functional Program Correctness Through Types
Doktorsavhandling, 2007
well-typed syntax
normalisation by evaluation
program correctness
total languages
partial languages
lazy evaluation
time complexity
strong invariants
dependent types
Författare
Nils Anders Danielsson
Chalmers, Data- och informationsteknik, Datavetenskap
A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),;Vol. LNCS 4502(2007)p. 93-109
Paper i proceeding
Lightweight Semiformal Time Complexity Analysis for Purely Functional Data Structures
35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL'08; San Francisco, CA; United States; 7 January 2008 through 12 January 2008,;(2008)p. 133-144
Paper i proceeding
Fast and Loose Reasoning is Morally Correct
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL 2006),;(2006)p. 206-217
Paper i proceeding
Ämneskategorier
Datavetenskap (datalogi)
ISBN
978-91-7385-034-6
Doktorsavhandlingar vid Chalmers tekniska högskola. Ny serie: 2715
Technical report D - Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University: 37
Lecture room EF, ED&IT building, Rännvägen 6B, Chalmers
Opponent: Professor Martin Hofmann, Institut für Informatik, Ludwig-Maximilians-Universität München, Germany