Filters








254 Hits in 1.8 sec

Howe's Method for Contextual Semantics

Serguei Lenglet, Alan Schmitt, Marc Herbstritt
2015 International Conference on Concurrency Theory  
We show how to use Howe's method to prove that context bisimilarity is a congruence for process calculi equipped with their usual semantics.  ...  We apply the method to two extensions of HOπ, with passivation and with join patterns, illustrating different proof techniques.  ...  Howe's Method in HOπ with Contextual Semantics 2.1 Syntax and Contextual Semantics We recall the syntax and contextual semantics of (the process-passing fragment of) HOπ [13] in Figure 1 , omitting  ... 
doi:10.4230/lipics.concur.2015.212 dblp:conf/concur/LengletS15 fatcat:2rkcun6aozfdrk5hheno7ehwzq

Howe's Method for Calculi with Passivation [chapter]

Sergueï Lenglet, Alan Schmitt, Jean-Bernard Stefani
2009 Lecture Notes in Computer Science  
We show how to apply Howe's method for the proof of congruence of early bisimilarities in a higher-order process calculus with passivation.  ...  We show that complementary semantics is equivalent to contextual semantics, originally introduced by Sangiorgi, that relies on classical transition systems for higher-order calculi and context bisimilarity  ...  Complementary Semantics for HOπP We define a new semantics for HOπP that coincides with the contextual one, yet allows the use of Howe's method to prove the soundness of early bisimilarities.  ... 
doi:10.1007/978-3-642-04081-8_30 fatcat:e7lqqt5sufgrza3gvbmstweyhi

Effectful Applicative Similarity for Call-by-Name Lambda Calculi

Ugo Dal Lago, Francesco Gavazzo, Ryo Tanaka
2017 Italian Conference on Theoretical Computer Science  
This is the first fullabstraction result for such a generic, coinductive methodology for program equivalence.  ...  The main techincal part of the Howe's method is the so-called Key Lemma, which basically states that the Howe's extension of a relation is contained in the relation itself.  ...  Howe's Lifting. Fig. 5 . 5 Fig. 5. Howe's Lifting for Frame Stacks.  ... 
dblp:conf/ictcs/LagoGT17 fatcat:fdt22bvlhvhc7djd4g6jg23jhu

Unique Fixed Point Induction for McCarthy's Amb [chapter]

Søren B. Lassen, Andrew Moran
1999 Lecture Notes in Computer Science  
We develop two sound and useful reasoning methods which, in combination, enable us to prove a rich collection of laws for contextual equivalence and also provide a unique xed point induction rule, the  ...  However, conventional semantic xed point principles for reasoning about recursion fail in the presence of fairness.  ...  Higher-order co-inductive operational techniques, based upon Howe's method for proving congruence of bisimulation equivalences for functional languages 7], have been applied to non-deterministic functional  ... 
doi:10.1007/3-540-48340-3_18 fatcat:vyhitovwoja4vit2z6rvex7cle

Extending Howe's Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names [chapter]

Jens Chr. Godskesen, Thomas Hildebrandt
2005 Lecture Notes in Computer Science  
We extend Howe's method to prove that input-early strong and -delay contextual bisimulations are congruences for the Higher-order mobile embedded resources (Homer) calculus, a typed higher order process  ...  The extension of Howe's method provides considerably simpler congruence proofs than established previously for similar calculi for mobile processes in nested locations.  ...  The simplicity of the calculus helps us to adapt Howe's method to show that both strong and so called delay input-early contextual bisimulation are congruences for Homer.  ... 
doi:10.1007/11590156_11 fatcat:pssrbz4ehraf5aikzcodod5fpu

Effectful applicative bisimilarity: Monads, relators, and Howe's method

Ugo Dal Lago, Francesco Gavazzo, Paul Blain Levy
2017 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)  
This is done by studying Howe's method in the abstract.  ...  We first of all endow a computational λ-calculus with a monadic operational semantics.  ...  Special thanks go to Davide Sangiorgi, Ryo Tanaka, and Valeria Vignudelli for many insightful discussions about the topics of this work.  ... 
doi:10.1109/lics.2017.8005117 dblp:conf/lics/LagoGL17 fatcat:vptwgwjebvc53byww7awi32jzy

Page 5482 of Mathematical Reviews Vol. , Issue 2003g [page]

2003 Mathematical Reviews  
“The central contributions of the paper are: the formulation, in a linear setting, of a good notion of program context and the associated contextual equivalence; an adaptation of Howe's method; the notion  ...  A general method is described for defining structural operational semantics of process operators by traditional transformation rules [G. D. Plotkin, Theoret. Comput.  ... 

Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB [chapter]

Manfred Schmidt-Schauß, David Sabel
2014 Lecture Notes in Computer Science  
Soundness of the applicative similarities w.r.t. contextual equivalence based on mayand should-convergence is proved by adapting Howe's method to should-convergence.  ...  As usual for nondeterministic calculi, similarity is not complete w.r.t. contextual equivalence which requires a rather complex counter example as a witness.  ...  Doing the same using Howe's method for ↑ X as for LCA shows: Theorem 5.3.  ... 
doi:10.1007/978-3-319-08918-8_26 fatcat:33sjdci5areorgevnexgun2j6m

Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus

Dariusz Biernacki, Sergueï Lenglet
2014 Electronical Notes in Theoretical Computer Science  
We propose the first sound and complete bisimilarities for the call-by-name and call-by-value untyped λμcalculus, defined in the applicative style.  ...  give equivalence examples to illustrate how our relations can be used; in particular, we prove David and Py's counter-example, which cannot be proved with Lassen's preexisting normal form bisimilarities for  ...  Acknowledgments: We thank Wojciech Jedynak and the anonymous referees for helpful comments on the presentation of this work.  ... 
doi:10.1016/j.entcs.2014.10.004 fatcat:cbe34xxbk5awflibeathbgvhhe

Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract) [chapter]

Davide Sangiorgi
2014 Lecture Notes in Computer Science  
Such proofs usually rely on Howe's method [How96] .  ...  method.  ...  Such proofs usually rely on Howe's method [How96] .  ... 
doi:10.1007/978-3-662-44124-4_1 fatcat:jmcahmpdejauveabvhsxrftwgy

Effectful Applicative Bisimilarity: Monads, Relators, and Howe's Method (Long Version) [article]

Ugo Dal Lago, Francesco Gavazzo, Paul Blain Levy
2017 arXiv   pre-print
This is done by studying Howe's method in the abstract.  ...  We first of all endow a computational λ-calculus with a monadic operational semantics.  ...  Special thanks go to Davide Sangiorgi, Ryo Tanaka, and Valeria Vignudelli for many insightful discussions about the topics of this work.  ... 
arXiv:1704.04647v1 fatcat:bgnjlbhwr5bbhe34xalgmc3xie

Susan Howe's Landscapes of Language:Articulation of Sound Forms in Timeand 'The Liberties'

Nancy Gaffield
2015 Women - A Cultural Review  
The theories and methods of stylistics offer one route for the reader to engage with this poetry. It makes the implicit explicit; it reveals what is at stake.  ...  The word 'enunciative' is more than a synonym for articulation; Howe's project is to make a public declaration.  ... 
doi:10.1080/09574042.2015.1069141 fatcat:4eloiaqbongahhyzvtjd7yefte

Characterizing contextual equivalence in calculi with passivation

Sergueï Lenglet, Alan Schmitt, Jean-Bernard Stefani
2011 Information and Computation  
Complementary semantics allows to apply the well-known Howe's method for proving the congruence of bisimilarities in a higher-order setting, even in the presence of an early form of bisimulation.  ...  which we call complementary semantics.  ...  Complementary semantics for HOπ We now propose a new semantics for HOπ that coincide with the contextual one yet allow the use of Howe's method to prove soundness of early bisimilarities.  ... 
doi:10.1016/j.ic.2011.08.002 fatcat:gkpm2qyasjhg3eusoq7cnvpfxy

A case study in programming coinductive proofs: Howe's method

ALBERTO MOMIGLIANO, BRIGITTE PIENTKA, DAVID THIBODEAU
2018 Mathematical Structures in Computer Science  
In this paper, we describe mechanizing the property that similarity in the call-by-name lambda calculus is a pre-congruence using Howe's method in the Beluga formal reasoning system.  ...  Bisimulation proofs play a central role in programming languages in establishing rich properties such as contextual equivalence.  ...  Mechanizing Howe's method in Beluga We discuss in this section the proof that similarity in PCFL is a pre-congruence using Howe's method in Beluga. Fig. 4.  ... 
doi:10.1017/s0960129518000415 fatcat:vv5qx7lh2rc27jbgzudi55j34e

Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi

Matthias Mann, Manfred Schmidt-Schauß
2010 Information and Computation  
Howe devised a method to prove this, and his method has been widely adapted and applied. This paper deals with this challenge for call-by-need computation including non-determinism.  ...  The main result is that for SHOCS languages mutual similarity is sound for reasoning about contextual equivalence based on may-convergence.  ...  Acknowledgments Authors thank an anonymous referee for detecting an error and for further valuable hints, and also the other referees for their comments, hints and demands.  ... 
doi:10.1016/j.ic.2009.11.003 fatcat:32rimryxd5evll6xbskmnvj4wa
« Previous Showing results 1 — 15 out of 254 results