Lawful functions and program verification in Miranda
- 31 May 1990
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 13 (2-3) , 181-218
- https://doi.org/10.1016/0167-6423(90)90070-t
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Views: a way for pattern matching to cohabit with data abstractionPublished by Association for Computing Machinery (ACM) ,1987
- Laws in MirandaPublished by Association for Computing Machinery (ACM) ,1986
- Miranda: A non-strict functional language with polymorphic typesLecture Notes in Computer Science, 1985
- The semantics of lazy (and industrious) evaluationPublished by Association for Computing Machinery (ACM) ,1982
- Can programming be liberated from the von Neumann style?Communications of the ACM, 1978
- Elementary Induction on Abstract StructuresStudies in Logic and the Foundations of Mathematics, 1974
- “Memo” Functions and Machine LearningNature, 1968