From SOS Rules to Proof Principles: An Operational Metatheory for Functional Languages (1997)

Cached

Download Links

by David Sands
Venue:In Proc. POPL'97, the 24 th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Citations:17 - 1 self

Active Bibliography

10 Improvement Theory and its Applications – David Sands - 1997
20 Relational Reasoning about Contexts – Søren B. Lassen - 1998
1 Interpreting functions as π-calculus processes: a tutorial – Davide Sangiorgi - 1999
1 Reasoning about Selective Strictness -- Operational Equivalence, Heaps and Call-by-Need Evaluation, New Inductive Principles – Seyed H. Haeri - 2009
Reasoning about Selective Strictness -- Operational Equivalence, Heaps and Call-by-Need Evaluation, New Inductive Principles – Seyed H. Haeri (Hossein) - 2009
External Examiner – Weng Kin Ho, Dr. Martín Escardó - 2006
1 An Equational Theory for a Region Calculus – Simon Helsen - 2002
38 Improvement in a Lazy Context: An Operational Theory for Call-By-Need – Andrew Moran, David Sands - 1999
8 Higher-Order Expression Procedures – David Sands - 1995
31 Proving the Correctness of Recursion-Based Automatic Program Transformations – David Sands - 1996
2 An operational domain-theoretic treatment of recursive types – Weng Kin Ho - 2006
10 Operational domain theory and topology of a sequential language – Martín Escardó, Weng Kin Ho - 2005
2 Bisimilarity for the region calculus – Simon Helsen
Adding Input-Output to PCF – Jerzy Tiuryn, Mitchell Wand - 1995
2 On the observational theory of the CPS-calculus ∗ – Massimo Merro
10 A conservative look at term deduction systems with variable binding – Wan Fokkink, Chris Verhoef - 1995
10 SOS formats and meta-theory: 20 years after – Mohammadreza Mousavi, Michel A. Reniers, Jan Friso Groote - 2007
6 Supercompiler HOSC: proof of correctness – Ilya G. Klyuchnikov - 2010
6 Possibilities and limitations of call-by-need space improvement – Jörgen Gustavsson - 2001