Nils Anders Danielsson

Nils Anders Danielsson
Datavetenskap
nad at chalmers dot se
+46 31 772 16 80

Visiting address:

Rännvägen 6
Rum 6480, floor 6
EDIT building, Campus Johanneberg

 

Link to personal page

Publikationer 2012

Danielsson, Nils Anders: Bag Equivalence via a Proof-Relevant Membership Relation. Interactive Theorem Proving, Third International Conference, ITP 2012, 7406 (LNCS) pp. 149-165. ISBN/ISSN: 978-3-642-32347-8

Danielsson, Nils Anders: Operational Semantics Using the Partiality Monad. SIGPLAN notices, 47 (9) pp. 127-138.

Danielsson, Nils Anders: Operational Semantics Using the Partiality Monad. Proceedings of the 17th ACM SIGPLAN international conference on Functional programming (ICFP 2012), pp. 127-138. ISBN/ISSN: 978-1-4503-1054-3

2008

Danielsson, Nils Anders: Lightweight Semiformal Time Complexity Analysis for Purely Functional Data Structures. Conference record of the 35th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL 2008),

2007

Danielsson, Nils Anders: A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family. Thorsten Altenkirch and Conor McBride (Eds.): Types for Proofs and Programs, International Workshop, TYPES 2006, Nottingham, UK, April 2006, Revised Selected Papers, LNCS 4502 pp. 93-109. ISBN/ISSN: 978-3-540-74463-4

Danielsson, Nils Anders: A Formalisation of the Correctness Result From "Lightweight Semiformal Time Complexity Analysis for Purely Functional Data Structures".

Danielsson, Nils Anders: Functional Program Correctness Through Types. Göteborg : Chalmers University of Technology. Diss. ISBN/ISSN: 978-91-7385-034-6

Danielsson, Nils Anders: Proofs Accompanying "Fast and Loose Reasoning is Morally Correct".

2006

Danielsson, Nils Anders; Hughes, John; Jansson, Patrik; Gibbons, Jeremy: Fast and Loose Reasoning is Morally Correct. Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL 2006), pp. 206-217. ISBN/ISSN: 1-59593-027-2

2005

Danielsson, Nils Anders: Precise Reasoning About Non-strict Functional Programs; How to Chase Bottoms, and How to Ignore Them. Göteborg : Chalmers University of Technology.

2004

Danielsson, Nils Anders; Jansson, Patrik: Chasing Bottoms: A Case Study in Program Verification in the Presence of Partial and Infinite Values. Proceedings of the 7th International Conference on Mathematics of Program Construction, MPC 2004, LNCS 3125, pp. 85-109. ISBN/ISSN: 3-540-22380-0

Uppdaterad: 27 februari 2013
Ansvarig för sidan: Eva Axelsson

 SÖK


DATA- OCH INFORMATIONSTEKNIK - Chalmers tekniska högskola och Göteborgs universitet - 412 96 Göteborg
Telefon: 031-772 1000