Fast and loose reasoning is morally correct

ACM SIGPLAN Notices

Volumn 41, Issue 1, 2006, Pages 206-217

  Danielsson, Nils Anders ^a   Hughes, John ^a   Jansson, Patrik ^a   Gibbons, Jeremy ^b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Equational reasoning; Inductive and coinductive types; Lifted types; Non strict and strict languages; Partial and infinite values; Partial and total languages

Indexed keywords

EQUATIONAL REASONING; INDUCTIVE AND COINDUCTIVE TYPES; LIFTED TYPES; NON-STRICT AND STRICT LANGUAGES; PARTIAL AND INFINITE VALUES; PARTIAL AND TOTAL LANGUAGES;

COMPUTATION THEORY; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; SEMANTICS;

FORMAL LOGIC;

EID: 33745207806     PISSN: 03621340     EISSN: 03621340     Source Type: Journal    
DOI: 10.1145/1111320.1111056     Document Type: Article

References (31)

1. [AAG05] Michael Abbott, Thorsten Altenkirch, and Neil Ghani. Containers: Constructing strictly positive types. Theoretical Computer Science, 342(1):3-27, 2005.
2. [Acz77] Peter Aczel. The strength of Martin-Löf's intuitionistic type theory with one universe. In Proceedings of Symposia in Mathematical Logic, Oulu, 1974, and Helsinki, 1975, pages 1-32, University of Helsinki, Department of Philosophy, 1977.
3. [BB91] Marek A. Bednarczyk and Andrzej M. Borzyszkowski. Cpo's do not form a cpo and yet recursion works. In VDM '91, volume 551 of LNCS, pages 268-278. Springer-Verlag, 1991.
4. [BdBH+91] R.C. Backhouse, P.J. de Bruin, P. Hoogendijk, G. Malcolm, T.S. Voermans, and J.C.S.P. van der Woude. Relational catamorphisms. In Constructing Programs from Specifications, pages 287-318. North-Holland, 1991.
5. [BdM96] Richard Bird and Oege de Moor. Algebra of Programming, Prentice Hall, 1996.
6. [Bee82] M. Beeson. Recursive models for constructive set theories. Annals of Mathematical Logic, 23:127-178, 1982.
7. [B1187] Andrzej Blikle. MetaSoft Primer, Towards a Metalanguage for Applied Denotational Semantics, volume 288 of LNCS. Springer-Verlag, 1987.
8. [BT83] Andrzej Blikle and Andrzej Tarlecki. Naive denotational semantics. In Information Processing 83, pages 345-355. North-Holland, 1983.
9. [Dan05] Nils Anders Danielsson. Personal web page, available at http://www.cs.chalmers.se/nad/, 2005.
10. [Dij76] Edsger W. Dijkstra. A Discipline of Programming, Prentice Hall, 1976.
11. [DJ04] Nils Anders Danielsson and Patrik Jansson. Chasing bottoms, a case study in program verification in the presence of partial and infinite values. In MPC 2004, volume 3125 of LNCS, pages 85-109. Springer-Verlag, 2004.
12. [Dyb85] Peter Dybjer. Program verification in a logical theory of constructions. In FPCA'85, volume 201 of LNCS, pages 334-349. Springer-Verlag, 1985.
13. Appears in revised form as Programming Methodology Group Report 26, University of Göteborg and Chalmers University of Technology, 1986.
14. [Dyb97] Peter Dybjer. Representing inductively defined sets by wellorderings in Martin-Löfs type theory. Theoretical Computer Science, 176:329-335, 1997.
15. [FM91] Maarten M Fokkinga and Erik Meijer. Program calculation properties of continuous algebras. Technical Report CS-R9104, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands, 1991.
16. [Fri75] Harvey Friedman. Equality between functionals. In Logic Colloquium: Symposium on Logic held at Boston, 1972-73, number 453 in Lecture Notes in Mathematics, pages 22-37. Springer, 1975.
17. [Hal87] Lars Hallnäs. An intensional characterization of the largest bisimulation. Theoretical Computer Science, 53(2-3):335-343, 1987.
18. [HG01] Graham Hutton and Jeremy Gibbons. The generic approximation lemma. Information Processing Letters, 79(4):197-201, 2001.
19. [HP90] Hagen Huwig and Axel Poigne. A note on inconsistencies caused by fixpoints in a cartesian closed category. Theoretical Computer Science, 73(1):101-112, 1990.
20. [Jeu90] J. Jeuring. Algorithms from theorems. In Programming Concepts and Methods, pages 247-266. North-Holland, 1990.
21. [JV04] Patricia Johann and Janis Voigtländer. Free theorems in the presence of seq. In POPL'04, pages 99-110. ACM Press, 2004.
22. [MFP91] E. Meijer, M. Fokkinga, and R. Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In FPCA '91, volume 523 of LNCS, pages 124-144. Springer-Verlag, 1991.
23. [MTHM97] Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The Definition of Standard ML (Revised). MIT Press, 1997.
24. [PJ03] Simon Peyton Jones, editor. Haskell 98 Language and Libraries, The Revised Report. Cambridge University Press, 2003.
25. [Pri02] Hilary A. Priestley. Ordered sets and complete lattices, a primer for computer science. In Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, volume 2297 of LNCS, chapter 2, pages 21-78. Springer-Verlag, 2002.
26. [Rey83] John C. Reynolds. Types, abstraction and parametric polymorphism. In Information Processing 83, pages 513-523. Elsevier, 1983.
27. [Rey84] John C. Reynolds. Polymorphism is not settheoretic. In Semantics of Data Types, volume 173 of LNCS, pages 145-156. Springer-Verlag, 1984.
28. [Sco76] Dana Scott. Data types as lattices. SIAM Journal of Computing, 5(3):522-587, 1976.
29. [Smi84] Jan Smith. An interpretation of Martin-Löf's type theory in a type-free theory of propositions. Journal of Symbolic Logic, 49(3):730-753, 1984.
30. [Tur96] David Turner. Elementary strong functional programming. In FPLE'95, volume 1022 of LNCS, pages 1-13. Springer-Verlag, 1996.
31. [Wad89] Philip Wadler. Theorems for free! In FPCA '89, pages 347-359. ACM Press, 1989.