Filters








78,827 Hits in 4.2 sec

Typed closure conversion preserves observational equivalence

Amal Ahmed, Matthias Blume
2008 SIGPLAN notices  
., compilation that both preserves and reflects observational equivalence.  ...  In particular, we prove that typed closure conversion for the polymorphic λ-calculus with existential and recursive types is fully abstract.  ...  This is the problem of equivalence-preserving compilation. In this paper, we have shown that typed closure conversion in the style of Morrisett et al. [21] is fully abstract.  ... 
doi:10.1145/1411203.1411227 fatcat:k7jwjcovfngj7c6w34tnzbuphq

Typed closure conversion preserves observational equivalence

Amal Ahmed, Matthias Blume
2008 Proceeding of the 13th ACM SIGPLAN international conference on Functional programming - ICFP '08  
., compilation that both preserves and reflects observational equivalence.  ...  In particular, we prove that typed closure conversion for the polymorphic λ-calculus with existential and recursive types is fully abstract.  ...  This is the problem of equivalence-preserving compilation. In this paper, we have shown that typed closure conversion in the style of Morrisett et al. [21] is fully abstract.  ... 
doi:10.1145/1411204.1411227 dblp:conf/icfp/AhmedB08 fatcat:6llfzaa55bbj7ol2dmtsixvcma

Typed closure conversion for the calculus of constructions

William J. Bowman, Amal Ahmed
2018 Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2018  
We develop a type-preserving closure-conversion translation from the Calculus of Constructions (CC) with strong dependent pairs (Σ types)---a subset of the core language of Coq---to a type-safe, dependently  ...  Unfortunately, type-preserving compilation of dependent types is hard.  ...  They develop a type-preserving closure conversion translation for this language.  ... 
doi:10.1145/3192366.3192372 dblp:conf/pldi/BowmanA18 fatcat:pik2kahntbespbwx4anhd5b3ti

Fully abstract compilation via universal embedding

Max S. New, William J. Bowman, Amal Ahmed
2016 SIGPLAN notices  
Our translation-specifically, closure conversion of simply typed λ-calculus with recursive types-uses types at the target level to ensure that a compiled component is never linked with attackers that have  ...  A fully abstract compiler guarantees that two source components are observationally equivalent in the source language if and only if their translations are observationally equivalent in the target.  ...  Parametricity of the language ensures that (standard) typed closure conversion is equivalence preserving.  ... 
doi:10.1145/3022670.2951941 fatcat:qdiychy7bzhc7e5les2y3rbqdy

Fully abstract compilation via universal embedding

Max S. New, William J. Bowman, Amal Ahmed
2016 Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming - ICFP 2016  
Our translation-specifically, closure conversion of simply typed λ-calculus with recursive types-uses types at the target level to ensure that a compiled component is never linked with attackers that have  ...  A fully abstract compiler guarantees that two source components are observationally equivalent in the source language if and only if their translations are observationally equivalent in the target.  ...  Parametricity of the language ensures that (standard) typed closure conversion is equivalence preserving.  ... 
doi:10.1145/2951913.2951941 dblp:conf/icfp/NewBA16 fatcat:pcxdfxryxfeabey5d2rgkabu4q

Object Closure Conversion

Neal Glew
1999 Electronical Notes in Theoretical Computer Science  
an example of closure conversion.  ...  This paper argues that a direct formulation of object closure conversion is interesting and gives further insight into general closure conversion.  ...  observational equivalence is preserved under type substitutions and substitutions of convergent observationally equivalent terms.  ... 
doi:10.1016/s1571-0661(05)80283-x fatcat:ronpklwigrehxoviz3qewu7lqu

Verified Compilers for a Multi-Language World

Amal Ahmed, Marc Herbstritt
2015 Summit on Advances in Programming Languages  
safe interoperability between more precisely typed, less precisely typed, and type-unsafe components.  ...  This is an unrealistic assumption since most software systems today are comprised of components written in different languages -both typed and untyped -compiled by different compilers to a common target  ...  Our proof methodology applied to closure conversion As an example, we show how our methodology can be used to prove compositional correctness of typed closure conversion [34, 36] for the simply-typed  ... 
doi:10.4230/lipics.snapl.2015.15 dblp:conf/snapl/Ahmed15 fatcat:dw3glfzj6zfzppzgais4bmxvsi

Linear Logical Relations for Session-Based Concurrency [chapter]

Jorge A. Pérez, Luís Caires, Frank Pfenning, Bernardo Toninho
2012 Lecture Notes in Computer Science  
As applications, we prove that all proof conversions induced by the logic interpretation actually express observational equivalences, and explain how type isomorphisms resulting from linear logic equivalences  ...  A main result is that well-typed processes always terminate (strong normalization). We also introduce a notion of observational equivalence for sessiontyped processes.  ...  An Observational Equivalence for Typed Processes Here we introduce typed context bisimilarity, an observational equivalence over typed processes.  ... 
doi:10.1007/978-3-642-28869-2_27 fatcat:gpkpmr5bgncxnbk3b3pn2nzjb4

object-oriented language [chapter]

Martin H. Weik
2000 Computer Science and Communications Dictionary  
We prove that the translation is fully type-preserving and that it preserves behaviour via the novel use of an environment-style semantics for System F.  ...  We present a type-preserving translation of System F (the polymorphic lambda calculus) into a forthcoming revision of the C programming language supporting parameterized classes and polymorphic methods  ...  Much of our translation is concerned with closure conversion. Two other works are relevant here. Harper et al. have formalized closure conversion for a typed functional language [12] .  ... 
doi:10.1007/1-4020-0613-6_12673 fatcat:4rn567gdazd2hfhcfnfglzezf4

Transposing F to C♯: expressivity of parametric polymorphism in an object-oriented language

Andrew Kennedy, Don Syme
2004 Concurrency and Computation  
We prove that the translation is fully type-preserving and that it preserves behaviour via the novel use of an environment-style semantics for System F.  ...  We present a type-preserving translation of System F (the polymorphic lambda calculus) into a forthcoming revision of the C programming language supporting parameterized classes and polymorphic methods  ...  Much of our translation is concerned with closure conversion. Two other works are relevant here. Harper et al. have formalized closure conversion for a typed functional language [12] .  ... 
doi:10.1002/cpe.801 fatcat:haq625qezzhnvbltr3cmsowtmm

A Higher-Order Abstract Syntax Approach to Verified Transformations on Functional Programs [article]

Yuting Wang, Gopalan Nadathur
2016 arXiv   pre-print
We do this by describing concise encodings in Lambda Prolog for transformations like typed closure conversion and code hoisting that are sensitive to such structure and by showing how to prove their correctness  ...  Informal verification of closure conversion To prove the correctness of closure conversion, we need a notion of equivalence between the source and target programs.  ...  Rich properties of programs can be embedded in types in Beluga, and Belanger et al. show how this feature can be exploited to ensure type preservation for closure conversion [7] .  ... 
arXiv:1509.03705v3 fatcat:5uhujqv7orendk7dp7cgpdyklq

Tracking Data-Flow with Open Closure Types [chapter]

Gabriel Scherer, Jan Hoffmann
2013 Lecture Notes in Computer Science  
A simply-typed lambda calculus is used to study the properties of the type theory of open closure types.  ...  This paper introduces open closure types, that is, function types that are decorated with type contexts. They are used to track data-flow from the environment into the function closure.  ...  Typed Closure Conversion. It is interesting to relate our open closure types and typed closure conversion of Minamide et al. [10] .  ... 
doi:10.1007/978-3-642-45221-5_47 fatcat:pv42btv2pjdmfehvpquvsxefna

Simulations and Bisimulations for Coalgebraic Modal Logics [chapter]

Daniel Gorín, Lutz Schröder
2013 Lecture Notes in Computer Science  
In essence, we arrive at a modular notion of equivalence that, when used with a separating set of monotone predicate liftings, coincides with T -behavioural equivalence regardless of whether T preserves  ...  corresponds to T -behavioural equivalence (moreover, this correspondence extends to the respective finite-lookahead counterparts), and iii) Λ-bisimulations remain sound when taken up to difunctional closure  ...  We show 'only if': observe that Z arises from X + Y by quotienting modulo the equivalence relation ∼ S generated by S.  ... 
doi:10.1007/978-3-642-40206-7_19 fatcat:gprfvxutw5g4nkh24wxbjoy2nu

Simulations and Bisimulations For Coalgebraic Modal Logics [article]

Daniel Gorín, Lutz Schröder
2013 arXiv   pre-print
corresponds to T-behavioural equivalence (moreover Lambda-n-bisimulations correspond to T-n-behavioural equivalence), and iii) in fact, for Lambda-separating and T preserving weak pullbacks, difunctional  ...  In essence, we arrive at a modular notion of equivalence that, when used with a separating set of monotone predicate liftings, coincides with T-behavioural equivalence regardless of whether T preserves  ...  We show 'only if': observe that Z arises from X + Y by quotienting modulo the equivalence relation ∼ S generated by S.  ... 
arXiv:1303.2467v2 fatcat:zemn5t5czjbida5p23r7n35hna

From Operational Chu Duality to Coalgebraic Quantum Symmetry [chapter]

Yoshihiro Maruyama
2013 Lecture Notes in Computer Science  
enriched with a generic concept of closure conditions that such operational dualities (which we call "T1-type" as opposed to "sober-type") actually exist in fairly diverse contexts (topology, measurable  ...  The universal form of T1-type dualities between point-set and point-free spaces is described in terms of Chu spaces and closure conditions.  ...  Lemma 14 For a closure-preserving map f : X → Y , B(f ) is closure-preserving. Lemma 15 Let X, Y, Z be closure spaces. (i) B(id X ) = id B(X) .  ... 
doi:10.1007/978-3-642-40206-7_17 fatcat:kue3jbalhzcenny5l3iswue6dm
« Previous Showing results 1 — 15 out of 78,827 results