Filters








3,657 Hits in 4.1 sec

The swiss coercion

Stefan Monnier
2007 Proceedings of the 2007 workshop on Programming languages meets program verification - PLPV '07  
Other than the coercion itself, another contribution of this work is a slightly different proof technique to show soundness of the type erasure.  ...  And all that, of course, for the price of a single coercion, which still costs absolutely nothing at runtime.  ...  And we have reformulated the coercion calculus itself as an inductive definition in our type language, the calculus of inductive constructions (CIC) [Paulin-Mohring, 1993 ].  ... 
doi:10.1145/1292597.1292604 dblp:conf/plpv/Monnier07 fatcat:jcdadgof25hezdv2ksuhfeweby

Automatic Verification of Security Properties in Remote Internet Voting Protocol with Applied Pi Calculus

Bo Meng, Wei Huang, Zimao Li, Dejun Wang
2010 International Journal of Digital Content Technology and its Applications  
Therefore, Meng protocol is modeled in applied pi calculus and the soundness and coercion-resistance take into account.  ...  Applied pi calculus is an extension of the pi calculus that inherits the constructs for communication and concurrency from the pure pi-calculus.  ...  This study was supported in part by Natural Science Foundation of South-Center University for Nationalities under the grants NO: YZZ09008.  ... 
doi:10.4156/jdcta.vol4.issue7.9 fatcat:knrcy2p5abatxir6veqylwbnaq

Page 2745 of Mathematical Reviews Vol. , Issue 98E [page]

1998 Mathematical Reviews  
Coquand’s “calculus of constructions” is a system of typed 4- calculus in which the second-order polymorphic typed A-calculus can be interpreted.  ...  The resulting term languages, the /"*-calculus and the linear 4*-calculus, respectively, are given sound categorical interpreta- tions.  ... 

System F with coercion constraints

Julien Cretin, Didier Rémy
2014 Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - CSL-LICS '14  
Type soundness is proved by adapting the step-indexed semantics technique to full reduction, moving indices inside terms so as to control the reduction steps internally-but this is only detailed in the  ...  We also distinguish coherent coercions that are fully erasable from potentially incoherent coercions that suspend the evaluation-and enable the encoding of GADTs.  ...  Acknowledgments We thank Gabriel Scherer for fruitful discussions on several aspects of this work.  ... 
doi:10.1145/2603088.2603128 dblp:conf/csl/CretinR14 fatcat:oqyxsxhuffbtzdmxrgnneaq53q

Syntactic soundness proof of a type-and-capability system with hidden state

FRANÇOIS POTTIER
2012 Journal of functional programming  
In particular, at the core of the system, the treatment of affinity, in the style of dual intuitionistic linear logic, is formulated in terms of an arbitrary monotonic separation algebra, a novel axiomatization  ...  of resources, ownership, and the manner in which they evolve with time.  ...  I would also like to thank the anonymous referees for their insightful suggestions, which helped greatly in improving the paper.  ... 
doi:10.1017/s0956796812000366 fatcat:zfpt3g34qjcsxfn7higmtlqk6u

Logical relations for coherence of effect subtyping [article]

Dariusz Biernacki, Piotr Polesiuk
2017 arXiv   pre-print
In this article we present heterogeneous, biorthogonal, step-indexed logical relations for establishing the coherence of coercion semantics of programming languages with subtyping.  ...  To illustrate the effectiveness of the proof method, we develop a proof of coherence of a type-directed, selective CPS translation from a typed call-by-value lambda calculus with delimited continuations  ...  Aristizábal, Ma lgorzata Biernacka, Klara Zielińska, and the anonymous reviewers of TLCA 2015 and LMCS for helpful comments on the presentation of this work.  ... 
arXiv:1710.09469v1 fatcat:marsdhazfjc4xl4eihresky4h4

Full Reduction in the Face of Absurdity [chapter]

Gabriel Scherer, Didier Rémy
2015 Lecture Notes in Computer Science  
When logical information is explicit inside terms, proposition variables delay the evaluation by construction.  ...  However, logical hypotheses may be left implicit, for the user's convenience in a surface language or because they have been erased prior to computation in an internal language.  ...  Terms We first describe terms of the consistent subset of F th , which are the terms of the untyped λ-calculus with products, extended with one additional construct for coercions.  ... 
doi:10.1007/978-3-662-46669-8_28 fatcat:yy7nhn76eraapc7w5wzufrgptq

Generativity and dynamic opacity for abstract types

Andreas Rossberg
2003 Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming - PPDP '03  
Sealing is represented as a generalized form of these coercions. The calculus maintains abstractions dynamically without restricting type analysis.  ...  It features an explicit construct for generating new type names and relies on coercions for managing abstraction boundaries between generated types and their designated representation.  ...  Syntax The syntax of the λ N -calculus is shown in figure 4 .  ... 
doi:10.1145/888251.888274 dblp:conf/ppdp/Rossberg03 fatcat:niurymzzurfvjglynmse3isfse

The Delta-calculus: syntax and types [article]

Luigi Liquori, Claude Stolze
2019 arXiv   pre-print
We present the Delta-calculus, an explicitly typed lambda-calculus with strong pairs, projections and explicit type coercions.  ...  The generic Delta-calculus can be parametrized to take into account other intersection type theories as the ones in the Barendregt et al. book.  ...  Acknowledgements We are grateful to Benjamin Pierce and Furio Honsell for the useful comments and remarks.  ... 
arXiv:1803.09660v4 fatcat:7msk26hi4raexahdc4jixtdbyq

A Temporal Logic Approach to Binding-Time Analysis

Rowan Davies
2017 Journal of the ACM  
This yields the simply typed λ -calculus which we prove to be equivalent to a multi-level binding-time analysis like those used in partial evaluation.  ...  In particular, we show how to extend the Curry-Howard isomorphism to include the ("next") operator from linear-time temporal logic.  ...  Finally, I would like to thank BRICS for offering a very stimulating and pleasant environment during my visit in the summer of 1995.  ... 
doi:10.1145/3011069 fatcat:es7u5yv3rjhdzbbyj2slcglqly

A Temporal-Logic Approach to Binding-Time Analysis

Rowan Davies
1995 BRICS Report Series  
This yields the simply typed lambda-calculus which we prove<br />to be equivalent to a multi-level binding-time analysis like those<br />used in partial evaluation.  ...  In particular,<br />we show how to extend the Curry-Howard isomorphism<br />to include the ("next") operator from linear-time temporal<br />logic.  ...  Finally, I would like to thank BRICS for offering a very stimulating and pleasant environment during my visit in the summer of 1995.  ... 
doi:10.7146/brics.v2i51.19952 fatcat:4uwp5tsdgfav5d7fhkcydrmjq4

Blame and coercion: together again for the first time

Jeremy Siek, Peter Thiemann, Philip Wadler
2015 SIGPLAN notices  
The calculi are: λB, based on the blame calculus of Wadler and Findler (2009); λC, inspired by the coercion calculus of Henglein (1994) ; λS inspired by the space-efficient calculus of Herman, Tomb, and  ...  establish the Fundamental Property of Casts, which required a custom bisimulation and six lemmas in earlier work.  ...  Acknowledgments Thanks to Shayan Najd, Michael Greenberg, and the PLDI referees for comments. Siek acknowledges NSF Grant 1360694.  ... 
doi:10.1145/2813885.2737968 fatcat:z6ay3pa4jfez7lacige4a54jjm

Blame and coercion: together again for the first time

Jeremy Siek, Peter Thiemann, Philip Wadler
2015 Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2015  
The calculi are: λB, based on the blame calculus of Wadler and Findler (2009); λC, inspired by the coercion calculus of Henglein (1994) ; λS inspired by the space-efficient calculus of Herman, Tomb, and  ...  establish the Fundamental Property of Casts, which required a custom bisimulation and six lemmas in earlier work.  ...  Acknowledgments Thanks to Shayan Najd, Michael Greenberg, and the PLDI referees for comments. Siek acknowledges NSF Grant 1360694.  ... 
doi:10.1145/2737924.2737968 dblp:conf/pldi/SiekTW15 fatcat:4zsnrwyipbd4doarfe7wrchpj4

Threesomes, with and without blame

Jeremy G. Siek, Philip Wadler
2010 SIGPLAN notices  
Herman, Tomb, and Flanagan ( 2007 ) solve the space problem by representing casts with the coercion calculus of Henglein (1994).  ...  The threesomes presented in this paper provide a streamlined data structure and algorithm for representing and normalizing coercions.  ...  Section 5 shows that the threesome calculus is isomorphic to a coercion-based calculus of Siek et al. (2009) . Some of the proofs are in-line and the rest are in the Appendix.  ... 
doi:10.1145/1707801.1706342 fatcat:k53d4tibxbeg5pemgxkuup4c2e

The Delta-calculus: Syntax and Types

Luigi Liquori, Claude Stolze, Michael Wagner
2019 International Conference on Rewriting Techniques and Applications  
We present the ∆-calculus, an explicitly typed λ-calculus with strong pairs, projections and explicit type coercions.  ...  In this paper, we define and prove the main properties of the ∆-calculus, a generic intersection typed system for an explicitly typed λ-calculus à la Church enriched with strong pairs, denoted by ∆ 1 ,  ...  The authors interpret types as sets in a well-suited model where the set-inspired type constructs are interpreted as the corresponding to set-theoretical constructs.  ... 
doi:10.4230/lipics.fscd.2019.28 dblp:conf/rta/LiquoriS19 fatcat:mjhdl53epbe65kc3ibkahzlpim
« Previous Showing results 1 — 15 out of 3,657 results