Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

LICS
1998
IEEE

favoriteEmaildiscussreport

106views Automated Reasoning» more LICS 1998»

A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages

13 years 8 months ago

A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages

Download basics.sjtu.edu.cn

In this paper we describe the promoted tyft tyxt rule format for de ning higher-order languages. The rule format is a generalization of Groote and Vaandrager's tyft tyxt format in which terms are allowed as labels on transitions in rules. We prove that bisimulation is a congruence for any language de ned in promoted tyft tyxt format and demonstrate the usefulness of the rule format by presenting promoted tyft tyxt de nitions for the lazy -calculus, CHOCS and the -calculus.

Karen L. Bernstein

Real-time Traffic

Automated Reasoning | LICS 1998 | Promoted Tyft Tyxt | Rule Format | Tyft Tyxt Format |

claim paper

Related Content

» Abstract Semantics for a HigherOrder Functional Language with Logic Variables

» SOS for Higher Order Processes

» Verification of HigherOrder Computation A GameSemantic Approach

» Congruence for Structural Congruences

» NewHOPLA A Higherorder Process Language with Name Generation

» Operational Semantics of Constraint Logic Programs with Coroutining

» A Truly Concurrent Semantics for a Simple Parallel Programming Language

» Proofproducing synthesis of ML from higherorder logic

» Weak Parametric Failure Equivalences and Their Congruence Formats

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	1998
Where	LICS
Authors	Karen L. Bernstein

Comments (0)