A Proof Calculus for Natural Semantics Based on Greatest Fixed Point Semantics

Electronic Notes in Theoretical Computer Science

Volumn 132, Issue 1, 2005, Pages 73-93

  Glesner, Sabine ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Coinductive greatest fixed point interpretation; Formal compiler correctness; Formal semantics; Natural semantics; Proof calculus

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; EMBEDDED SYSTEMS; PROBLEM SOLVING; PROGRAM COMPILERS;

COINDUCTIVE/GRETEST FIXED POINT INTERPRETATION; FORMAL COMPLIER CORRECTNESS; FORMAL SEMANTICS; NATURAL SEMANTICS; PROOF CALCULUS;

SEMANTICS;

EID: 18544376519     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.02.011     Document Type: Conference Paper

References (18)

1. Roland Backhouse Roy Crole Jeremy Gibbons Algebraic and Coalgebraic Methods in the Mathematics of Program Construction LNCS 2297 2002 Springer International Summer School and Workshop, Oxford, UK, April 10-14, 2000, Revised Lectures
2. Patrick Cousot, and Radhia Cousot Inductive Definitions, Semantics and Abstract Interpretation Proc. 19th ACM Symposium on Principles of Programming Languages 1992 ACM 84 94
3. Sophia Drossopoulou, and Susan Eisenbach Describing the Semantics of Java and Proving Type Soundness J. Alves-Foss Formal Syntax and Semantics of Java LNCS 1523 1999 Springer Verlag 41 ff
4. Axel Dold, and Vincent Vialard A Mechanically Verified Compiling Specification for a Lisp Compiler Proceedings of the 21st Conference on Software Technology and Theoretical Computer Science (FSTTCS 2001) LNCS 2245 2001 Springer Verlag 144 155
5. Andrew D. Gordon. A Tutorial on Co-Induction and Functional Programming. In Proceedings of the 1994 Glasgow Workshop on Functional Programming, September 1994, Ayr, Scotland, 1995. Springer Workshops in Computing
6. C.A.R. Hoare An Axiomatic Basis for Computer Programming Communications of the ACM 12 10 October 1969 576 580
7. Husain Ibraheem, and David A. Schmidt Adapting Big-Step Semantics to Small-Step Style: Coinductive Interpretations and "Higher-Order" Derivations Proceedings 2nd Workshop on Higher-Order Techniques in Operational Semantics (HOOTS2), Stanford ENTS 1998 Elsevier
8. Bart Jacobs, and Jan Rutten A Tutorial on (Co)Algebras and (Co)Induction EATCS Bulletin 67 1997 222 259
9. Gilles Kahn Natural Semantics Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science (STACS'87), Passau, Germany LNCS 247 February 1987 Springer 22 39
10. Hanne Riis Nielson, and Flemming Nielson Semantics with Applications: A Formal Introduction 1992 John Wiley & Sons revised edition available at http://www.daimi.au.dk/~hrn 1999
11. Flemming Nielson, Hanne Riis Nielson, and Chris Hankin Principles of Program Analysis 1999 Springer
12. S. Owre, J.M. Rushby, and N. Shankar PVS: A Prototype Verification System Proc. 11th Int'l Conference on Automated Deduction CADE Lecture Notes in Artificial Intelligence vol. 607 1992 Springer-Verlag
13. Lawrence C. Paulson A Fixedpoint Approach to (Co)Inductive and (Co)Datatype Definitions 2002 Computer Laboratory, University of Cambridge England
14. David Schmidt Programming Language Semantics CRC Handbook of Computer Science 1996 CRC Press Boca Raton, USA
15. Igor A. Siveroni. Correctness of Analysis-based Program Transformations of Functional Programming Languages. PhD thesis, College of Computer Science, Northeastern University, Boston, USA, 2002
16. Don Syme Proving Java Type Soundness Formal Syntax and Semantics of Java LNCS 1523 1999 Springer Verlag 83 ff
17. David von Oheimb. Analyzing Java in Isabelle/HOL. PhD thesis, Technische Universität München, Germany, 2001
18. light is Type-Safe - Definitely Proceedings of the 25th ACM Symposium on the Principles of Programming Languages January 19-21 1998 ACM Press