Pages that link to "Item:Q1917068"
From MaRDI portal
The following pages link to Proving congruence of bisimulation in functional programming languages (Q1917068):
Displaying 50 items.
- Applicative bisimilarities for call-by-name and call-by-value \(\lambda\mu\)-calculus (Q283739) (← links)
- A two-valued logic for properties of strict functional programs allowing partial functions (Q352946) (← links)
- Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax (Q438569) (← links)
- On the expressiveness and decidability of higher-order process calculi (Q627133) (← links)
- Characterizing contextual equivalence in calculi with passivation (Q651309) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- On generic context lemmas for higher-order calculi with sharing (Q960863) (← links)
- Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi (Q964003) (← links)
- A conservative look at operational semantics with variable binding (Q1273877) (← links)
- Semantical analysis of perpetual strategies in \(\lambda\)-calculus (Q1275628) (← links)
- Process calculus based upon evaluation to committed form (Q1276241) (← links)
- Operational equivalence for interaction nets. (Q1401297) (← links)
- Asynchronous process calculi: The first- and higher-order paradigms (Q1589656) (← links)
- On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus (Q1763728) (← links)
- Axioms for strict and lazy functional programs (Q1772783) (← links)
- Bisimilarity of open terms. (Q1854331) (← links)
- Vertical implementation (Q1854462) (← links)
- A format for semantic equivalence comparison (Q1884897) (← links)
- Effectful applicative similarity for call-by-name lambda calculi (Q1989333) (← links)
- \(\mathrm{HO}\pi\) in Coq (Q2031410) (← links)
- On bisimilarity in lambda calculi with continuous probabilistic choice (Q2133169) (← links)
- Quantitative logics for equivalence of effectful programs (Q2133179) (← links)
- Mechanized metatheory revisited (Q2323447) (← links)
- Observational program calculi and the correctness of translations (Q2339472) (← links)
- Program equivalence in linear contexts (Q2346993) (← links)
- Encoding abstract syntax without fresh names (Q2392477) (← links)
- Fairness and communication-based semantics for session-typed languages (Q2672270) (← links)
- Program equivalence in an untyped, call-by-value functional language with uncurried functions (Q2693299) (← links)
- Exploratory Functions on Nondeterministic Strategies, up to Lower Bisimilarity (Q2805166) (← links)
- Syntactic Logical Relations for Polymorphic and Recursive Types (Q2864153) (← links)
- On Well-Foundedness and Expressiveness of Promoted Tyft (Q2866315) (← links)
- Contextual equivalence for inductive definitions with binders in higher order typed functional programming (Q2875221) (← links)
- On Equivalences, Metrics, and Polynomial Time (Q2947890) (← links)
- Howe’s Method for Calculi with Passivation (Q3184692) (← links)
- A Complete, Co-inductive Syntactic Theory of Sequential Control and State (Q3184753) (← links)
- Applicative Bisimulation and Quantum λ-Calculi (Q3455863) (← links)
- Complete Lattices and Up-To Techniques (Q3498446) (← links)
- A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case (Q3522027) (← links)
- Normal Bisimulations in Calculi with Passivation (Q3617734) (← links)
- (Q4222932) (← links)
- Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion (Q4921510) (← links)
- A categorical framework for congruence of applicative bisimilarity in higher-order languages (Q5043601) (← links)
- A case study in programming coinductive proofs: Howe’s method (Q5236557) (← links)
- Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report) (Q5240138) (← links)
- MARTIN-LÖF'S TYPE THEORY AS AN OPEN-ENDED FRAMEWORK (Q5249247) (← links)
- Amb Breaks Well-Pointedness, Ground Amb Doesn't (Q5262940) (← links)
- Bisimulation and Co-induction: Some Problems (Q5262977) (← links)
- Reasoning about multi-stage programs (Q5371979) (← links)
- (Q5377471) (← links)
- From Applicative to Environmental Bisimulation (Q5739359) (← links)
