Coinductive big-step operational semantics (original) (raw)
Related papers
Big-step Operational Semantics Revisited
Fundamenta Informaticae, 2010
A case study in programming coinductive proofs: Howe's method
Mathematical Structures in Computer Science
Type soundness proofs with definitional interpreters
ACM SIGPLAN Notices, 2017
Soundness Conditions for Big-Step Semantics
Lecture Notes in Computer Science, 2020
Formalizing and verifying semantic type soundness of a simple compiler
2007
Deriving Proof Rules from Continuation Semantics
Formal Aspects of Computing, 1999
Towards Effects in Mathematical Operational Semantics
Electronic Notes in Theoretical Computer Science, 2011
Formal verification in Coq of program properties involving the global state effect
An abstract monadic semantics for value recursion
RAIRO - Theoretical Informatics and Applications, 2004
The formal semantics of programming languages: an introduction
Choice Reviews Online
Programming with proofs and explicit contexts
Proceedings of the 10th international ACM SIGPLAN symposium on Principles and practice of declarative programming - PPDP '08, 2008
Operational Semantics for Lazy Evaluation
Journal of Computer Science, 2007
Mechanized semantics for compiler verification
A Context-based Approach to Proving Termination of Evaluation
Electronic Notes in Theoretical Computer Science, 2009
Operational Semantics for Functional Logic Languages
Electronic Notes in Theoretical Computer Science, 2002
Hybrid: A definitional two-level approach to reasoning with higher-order abstract syntax
Arxiv preprint arXiv:0811.4367, 2008
A deterministic operational semantics for functional logic programs
2002
Nominal formalisations of typical SOS proofs
2008
Formalizing and Verifying Semantic Type Soundness of a Simple Compiler (Preliminary Report
2007
Proving make correct: I/o proofs in two functional languages
Glenn Strong, Andrew Butterfield
2003
Towards Verified Lazy Implementation of Concurrent Value-Passing Languages (Abstract)
Electronic Notes in Theoretical Computer Science, 1999
Automated termination proofs for haskell by term rewriting
Jürgen Giesl, Peter Schneider-kamp
ACM Transactions on Programming Languages and Systems, 2011
Bind Induction : Extracting Monadic Programs from Proofs
2013
Forth Semantics for Compiler Verification
2012
Towards an operational semantics for a parallel non-strict functional language
1999
Towards a mathematical operational semantics
Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science
A Dynamic Semantics for Haskell
1992
Mechanized Semantics of Simple Imperative Programming Constructs
Toy(FD): Sketch of Operational Semantics
Lecture Notes in Computer Science, 2003
Effective interactive proofs for higher-order imperative programs
ACM SIGPLAN Notices, 2009
Mechanized Semantics for the Clight Subset of the C Language
Journal of Automated Reasoning, 2009
Proving ML Type Soundness Within Coq
Lecture Notes in Computer Science, 2000
Reasoning on an imperative object-based calculus in Higher Order Abstract Syntax
Proceedings of the 2003 workshop on Mechanized reasoning about languages with variable binding - MERLIN '03, 2003
Verifying haskell programs using constructive type theory
Proceedings of the 2005 ACM SIGPLAN workshop on Haskell - Haskell '05, 2005