research-article

Open access

A logic for Miranda, revisited

Author:

Simon ThompsonAuthors Info & Claims

Formal Aspects of Computing, Volume 7, Issue 4

Pages 412 - 429

https://doi.org/10.1007/BF01211216

Published: 01 July 1995 Publication History

PDF eReader

Abstract

This paper expands upon work begun in [Tho89], in building a logic for the Miranda functional programming language. After summarising the work in that paper, a translation of Miranda definitions into logical formulas is presented, and illustrated by means of examples. This work expands upon [Tho89] in giving a complete treatment of sequences of equations, and by examining how to translate the local definitions introduced by where clauses.

The status of the logic is then examined, and it is argued that the logic extends a natural operational semantics of Miranda, given by the translations of definitions into conditional equations.

Finally it is shown how the logic can be implemented in the Isabelle proof tool.

References

[1]

Hudak, P., Peyton Jones, S. and Wadler, P.: (Editors). Report on the Programming Language Haskell, version 1.2.ACM SIGPLAN Notices, 27(5), 1992.

Google Scholar

[2]

Klop., J. W.: Term rewriting systems. In Samson Abramsky, Tom Maibaum, and Dov Gabbay, editors,Handbook of Logic in Computer Science, Volume II. Oxford University Press, 1993.

Google Scholar

[3]

Milner, R., Tofte, M. and Harper, R.:The Definition of Standard ML. MIT Press, 1990.

Google Scholar

[4]

Paulson, L. C.:Logic and Computation —Interactive proof with Cambridge LCF. Cambridge University Press, 1987.

Google Scholar

[5]

Paulson, L. C: Isabelle: the next 700 theorem provers. In P. Oddifreddi, editor,Logic and Computer Science. Academic Press, 1990.

Google Scholar

[6]

Peyton Jones, S.:The Implementation of Functional Programming Languages. Prentice Hall International, 1987.

Google Scholar

[7]

Thompson, S. J.: A Logic for Miranda.Formal Aspects of Computing, 1, 1989.

Google Scholar

[8]

Thompson, S. J.: Formulating Haskell. InWorkshop on Functional Programming, Ayr, 1992, Workshops in Computing. Springer Verlag, 1993.

Google Scholar

[9]

Turner, D. A.: An overview of Miranda. In David A. Turner, editor,Research Topics in Functional Programming. Addison Wesley, 1990.

Google Scholar

Cited By

View all

Harrison WKieburtz R(2005)The logic of demand in HaskellJournal of Functional Programming10.1017/S095679680500566615:6(837-891)Online publication date: 1-Nov-2005
https://dl.acm.org/doi/10.1017/S0956796805005666
Chitil O(1997)The ζ-Semantics: A Comprehensive Semantics for Functional ProgramsFundamenta Informaticae10.5555/2379441.237944531:3,4(253-294)Online publication date: 1-Dec-1997
https://dl.acm.org/doi/10.5555/2379441.2379445

Index Terms

A logic for Miranda, revisited

Index terms have been assigned to the content through auto-classification.

Recommendations

A logic for Miranda
Abstract
We formulate a logical description of the functional programming language Miranda. Distinctive features include a full treatment of pattern matching with repeated variables and the characterisation of various (sub-)domains, like the defined ...
One-Path Reachability Logic
LICS '13: Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

This paper introduces *(one-path) reach ability logic*, a language-independent proof system for program verification, which takes an operational semantics as axioms and derives *reach ability rules*, which generalize Hoare triples. This system improves ...
Operational Semantics and Program Verification Using Many-Sorted Hybrid Modal Logic
Automated Reasoning with Analytic Tableaux and Related Methods
Abstract
We propose a general framework to allow: (a) specifying the operational semantics of a programming language; and (b) stating and proving properties about program correctness. Our framework is based on a many-sorted system of hybrid modal logic, ...

Comments

Information & Contributors

Information

Published In

Formal Aspects of Computing Volume 7, Issue 4

Jul 1995

120 pages

ISSN:0934-5043

EISSN:1433-299X

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 July 1995

Accepted: 15 February 1995

Received: 15 March 1994

Published in FAC Volume 7, Issue 4

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
20
Total Downloads

Downloads (Last 12 months)9
Downloads (Last 6 weeks)1

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Harrison WKieburtz R(2005)The logic of demand in HaskellJournal of Functional Programming10.1017/S095679680500566615:6(837-891)Online publication date: 1-Nov-2005
https://dl.acm.org/doi/10.1017/S0956796805005666
Chitil O(1997)The ζ-Semantics: A Comprehensive Semantics for Functional ProgramsFundamenta Informaticae10.5555/2379441.237944531:3,4(253-294)Online publication date: 1-Dec-1997
https://dl.acm.org/doi/10.5555/2379441.2379445

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

References

Cited By

Index Terms

Recommendations