Filters








4,398 Hits in 4.4 sec

Computational Soundness of a Call by Name Calculus of Recursively-scoped Records

Elena Machkasova
2008 Electronical Notes in Theoretical Computer Science  
Abstract The paper presents a calculus of recursively-scoped records: a two-level calculus with a traditional call-by-name λ-calculus at a lower level and unordered collections of labeled λ-calculus terms  ...  Terms in records may reference each other, possibly in a mutually recursive manner, by means of labels.  ...  Computational Soundness of a Call by Name Calculus of Recursively-scoped Records  ... 
doi:10.1016/j.entcs.2008.03.059 fatcat:tevxoejxfnh2tn6jkyfr6b5n4e

The Theory of Classification, Part 3: Object Encoding and Recursion

Anthony J.H. Simons
2002 Journal of Object Technology  
To appreciate this contrast, we must understand something of the λ-calculus [6], which was invented by Church in the late 1930s as a primitive model of computation.  ...  This may sound strange, but recall how a record is really a finite set of label-to-value mappings, while a function is a general set of value-to-value mappings [2] .  ... 
doi:10.5381/jot.2002.1.4.c4 fatcat:jsj5zil3vngmrdf7zpgcohggg4

A Calculus for Link-Time Compilation [chapter]

Elena Machkasova, Franklyn A. Turbak
2000 Lecture Notes in Computer Science  
We introduce a new technique, based on properties we call lift and project, that uses a weaker notion of confluence with respect to evaluation to establish computational soundness for our module calculus  ...  This result is interesting because recursive module bindings thwart confluence at two levels of our calculus, and prohibit application of the traditional technique for showing computational soundness,  ...  Inspired by [AZ99] , we would like to parameterize our module calculus over any base calculus.  ... 
doi:10.1007/3-540-46425-5_17 fatcat:c3hzc3h7lzfp3k7kocxqsytab4

A calculus of mobile processes, I

Robin Milner, Joachim Parrow, David Walker
1992 Information and Computation  
The rr-calculus gains simplicity by removing all distinction between variables and constants; communication links are identified by names, and computation is represented purely as the communication of  ...  We present the a-calculus, a calculus of communicating systems in which one can naturally express processes which have changing structure.  ...  Proof: In the companion paper (Milner, Parrow, and Walker, 1989) . 1 Recursion We record here the properties which we would expect of recursive defmitions, by analogy with CCS .  ... 
doi:10.1016/0890-5401(92)90008-4 fatcat:ei4ymznuijagjdf5c7pshk3w3e

Event Structure Semantics of Parallel Extrusion in the Pi-Calculus [chapter]

Silvia Crafa, Daniele Varacca, Nobuko Yoshida
2012 Lecture Notes in Computer Science  
Intuitively, E encodes the structural causality of the process, while the set X affects the computation on E so as to capture the causal dependencies introduced by scope extrusion.  ...  We give a compositional event structure semantics of the π-calculus. The main issues to deal with are the communication of free names and the extrusion of bound names.  ...  The third author is partially supported by EPSRC EP/F003757/01 and G015635/01.  ... 
doi:10.1007/978-3-642-28729-9_15 fatcat:hf32y7wxm5be5ekp5cplmthfoa

The implicit calculus

Bruno C.d.S. Oliveira, Tom Schrijvers, Wontae Choi, Wonchan Lee, Kwangkeun Yi
2012 Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation - PLDI '12  
This paper synthesizes the key ideas of implicits formally in a minimal and general core calculus called the implicit calculus (λ ?  ...  Ultimately, the implicit calculus provides a formal model of implicits, which can be used by language designers to study and inform implementations of similar mechanisms in their own languages.  ...  2010-0022061, and by Singapore Ministry of Education research grant MOE2010-T2-2-073.  ... 
doi:10.1145/2254064.2254070 dblp:conf/pldi/OliveiraSCLY12 fatcat:qutlckzhrva2vinmwbgtix4nz4

The implicit calculus

Bruno C.d.S. Oliveira, Tom Schrijvers, Wontae Choi, Wonchan Lee, Kwangkeun Yi
2012 SIGPLAN notices  
This paper synthesizes the key ideas of implicits formally in a minimal and general core calculus called the implicit calculus (λ ?  ...  Ultimately, the implicit calculus provides a formal model of implicits, which can be used by language designers to study and inform implementations of similar mechanisms in their own languages.  ...  2010-0022061, and by Singapore Ministry of Education research grant MOE2010-T2-2-073.  ... 
doi:10.1145/2345156.2254070 fatcat:2tfcedbrinckzitjsmagazk25e

A Fresh Calculus for Name Management [chapter]

Davide Ancona, Eugenio Moggi
2004 Lecture Notes in Computer Science  
We define a basic calculus for name management, which is obtained by an appropriate combination of three ingredients: extensible records (in a simplified form), names (as in FreshML), computational types  ...  (to allow computational effects, including generation of fresh names).  ...  We consider the classical power function exp:int->real->M real, which takes an exponent n and a base x, then it computes x n by making recursive calls.  ... 
doi:10.1007/978-3-540-30175-2_11 fatcat:s6u5txsazbdxpbbit44u2quuiy

Initializing Mutually Referential Abstract Objects: The Value Recursion Challenge

Don Syme
2006 Electronical Notes in Theoretical Computer Science  
corresponds to a graph of lazy computations whose nodes are sequentially forced, requiring runtime checks for soundness during initialization in the style of Russo.  ...  This paper aims to augment ongoing theoretical work on value recursion with a description of a semi-safe mechanism for a generalized form of value recursion in an ML-like language, where initialization  ...  Hence the execution of a recursive binding leaves no unresolved delayed computations, and thus the delayed computations do not escape their lexical scope, as captured by the following theorem: 7 Theorem  ... 
doi:10.1016/j.entcs.2005.11.038 fatcat:5oq5mbebybadlfslzzhfda27s4

Formalizing φ-calculus: a purely object-oriented calculus of decorated objects [article]

Nikolai Kudasov, Violetta Sim
2022 arXiv   pre-print
Finally, we provide a sound translation to λ-calculus with records.  ...  We prove the calculus is confluent (i.e. possesses Church-Rosser property), and introduce an abstract machine for call-by-name evaluation.  ...  ACKNOWLEDGMENTS This research has been generously funded by Huawei in the framework of Polystat project.  ... 
arXiv:2204.07454v1 fatcat:5nij2n44hrdnnkkyz5d3ymswku

An interpretation of extensible objects [chapter]

Gérard Boudol, Silvano Dal-Zilio
1999 Lecture Notes in Computer Science  
We provide a translation of Fisher-Honsell-Mitchell's delegation-based object calculus with subtyping into a -calculus with extensible records.  ...  The target type system is an extension of the system F ! of dependent types with recursion, extensible records and a form of bounded universal quanti cation.  ...  Then the idea of our encoding is to separate the two usages of a prototype by means of record eld selection: in our interpretation, a prototype is a recursive record with two elds.  ... 
doi:10.1007/3-540-48321-7_11 fatcat:gpv2rokdozcu3nqtilxbrymqym

iRho: an imperative rewriting calculus

LUIGI LIQUORI, BERNARD PAUL SERPETTE
2008 Mathematical Structures in Computer Science  
We formulate both a static and big-step call-by-value operational semantics of iRho.  ...  We propose an imperative version of the Rewriting Calculus, a calculus based on pattern matching, pattern abstraction and side effects, which we call iRho.  ...  This work is supported by the French grant CNRS ACI Modulogic and by the AEOLUS FET Global Computing Proactive, Algorithmic Principles for Building Efficient Overlay Computers.  ... 
doi:10.1017/s0960129508006750 fatcat:xqxtkv75kzcxvgx2cabyh7zeea

Imperative Objects and Mobile Processes [chapter]

J. Kleist, D. Sangiorgi
1998 Programming Concepts and Methods PROCOMET '98  
The proof of computational adequacy makes use of (a rr-calculus version) of ready simulation, and of a factorisation of the interpretation into a functional part and a very simple imperative part.  ...  An interpretation of Abadi and Cardelli's first-order Imperative Object Calculus into a typed rr-calculus is presented.  ...  An interpretation of IOC into a form of imperative polymorphic A.-calculus with subtyping, recursive types and records has been found by Abadi, Cardelli & Viswanathan (1996) .  ... 
doi:10.1007/978-0-387-35358-6_20 fatcat:3obz65dtpne3lpffekdy7jfpki

Essential retroactive weaving

Robin Salkeld, Ronald Garcia
2015 Companion Proceedings of the 14th International Conference on Modularity - MODULARITY Companion 2015  
In particular a key concern of retroactive weavers is maintaining soundness: behaving consistently with the context of the past execution, and failing if missing information makes this impossible.  ...  We demonstrate this transformation by applying it to a simple core aspect-oriented language, and through a definitional interpreter illustrate its interactions with first-class function values, mutable  ...  Acknowledgments A portion of this work was funded by an NSERC Discovery Grant.  ... 
doi:10.1145/2735386.2736751 dblp:conf/aosd/SalkeldG15 fatcat:o2co5rkycjdzlcyksisnf2oam4

Effects as sessions, sessions as effects

Dominic Orchard, Nobuko Yoshida
2016 SIGPLAN notices  
The work has been partially sponsored by EPSRC EP/K011715/1, EP/K034413/1, EP/L00058X/1, and EU project FP7-612985 UpScale.  ...  Introduction The simple type theory for the λ-calculus classifies the range of input and output values required by, and provided by, a computation.  ...  The effect of a recursive binding (rec) is the same as that of its body and recursive call. The closure operator (−) * is often required to provide a valid typing for a recursive definition.  ... 
doi:10.1145/2914770.2837634 fatcat:dpjmbboswrfmhdz4cs6y5bdliq
« Previous Showing results 1 — 15 out of 4,398 results