A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
A Theory of Explicit Substitutions with Safe and Full Composition
2009
Logical Methods in Computer Science
Preserved Fulltext
Other Versions
Then, very simple technology in named variable-style notation is used to establish a theory of explicit substitutions for the lambda-calculus which enjoys a whole set of useful properties such as full ...
Many different systems with explicit substitutions have been proposed to implement a large class of higher-order languages. ...
A THEORY OF EXPLICIT SUBSTITUTIONS WITH SAFE AND FULL COMPOSITION 15
Intersection Types The simply typed calculus is a typed lambda calculus whose only type connective is the function type. ...
doi:10.2168/lmcs-5(3:1)2009
fatcat:ipcshpm7jrea7jzuxgpyw3vhva
A Compositional Specification Theory for Component Behaviours
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We introduce a refinement preorder that supports safe-substitutivity of components. ...
We propose a compositional specification theory for reasoning about components that interact by synchronisation of input and output (I/O) actions, in which the specification of a component constrains the ...
The authors are supported by EU FP7 project CONNECT and ERC Advanced Grant VERIWARE. We would also like to thank the anonymous reviewers for their insightful comments. ...
doi:10.1007/978-3-642-28869-2_8
fatcat:ojwbqatjpzhh7objbbpjyfjlhq
The Safe Machine: A New Specification Construct for B
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We compare the role of state invariants in Z and other statebased formalisms with that of abstract machine invariants in B. ...
We illustrate the utility of our proposal with a small specification example, our Electronic Thesaurus. ...
Acknowledgements I am indebted to my Teesside colleagues Bill Stoddart and Richard Shore, and to Andy Galloway of York, for countless fruitful discussions on many of the ideas in this paper. ...
doi:10.1007/3-540-48119-2_27
fatcat:7sviyspqs5h4ljoa2hyyz7yrdy
On the Expressiveness of Pure Mobile Ambients
2003
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In order to simplify the proof and give an intuitive understanding of the encoding, we design an intermediate language: the -Calculus with Explicit Substitutions and Channels, which is a syntactic extension ...
of the -calculus with a speci c operational semantics. ...
Acknowledgement I bene ted from many discussions with Davide Sangiorgi for this work. Thanks also to Ilaria Castellani and G rard Boudol, as well as the other membersof the Mimosa and Tick teams. ...
doi:10.1016/s1571-0661(05)82506-x
fatcat:fpzbimpvfbepllmdgcyeaadu3e
Page 10274 of Mathematical Reviews Vol. , Issue 2004m
[page]
2004
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
In order to simplify the proof and give an intuitive understanding of the encoding, we design an intermediate language, the z-calculus with explicit substitutions and channels, which is an extension of ...
Softw. 15 (2004),
Summary: “In order to specify the behaviors of structure-complex Petri nets, the concept of synchronous composition is extended and a method is presented with which a given structure-complex ...
Page 4275 of Mathematical Reviews Vol. , Issue 95g
[page]
1995
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “We study the relation between Wadler’s steadfast linear type system and calculi with explicit sharing. ...
, itten for a rather follows: Theory ition al- Aatricial yynchro- Jes with symbols,
ickland)
nces. 6-95,
lazy ver- ic means, are pre- ict types, 2se theo-
4275 68Q Theory of computing
rems show that the ...
Revisiting the categorical interpretation of dependent type theory
2014
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We show that Hofmann's and Curien's interpretations of Martin-Löf's type theory, which were both designed to cure a mismatch between syntax and semantics in Seely's original interpretation in locally cartesian ...
As an outcome, we obtain a new proof of the coherence theorem needed to show the soundness after all of Seely's interpretation. ...
And last but not least, we wish to thank the editors of this volume for this occasion to honour our friend and colleague Glynn Winskel, a contemporary of the first author, who remembers vividly our conversations ...
doi:10.1016/j.tcs.2014.03.003
fatcat:wvlhemz2yzbpvpkxbaxeumni7y
Logical Analysis of Hybrid Systems
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
A.4 Proof Calculus
. . 356 A.7 Computability Theory and Decidability . . . . . . . . . . . . . . . 357 Ordinary Differential Equations . . . . . . . . . . . . . . . . . . . 359 B.2 Existence Theorems ...
7.3.3
Conclusion Part IV Appendix A First-Order Logic and Theorem Proving A.1 Overview . ...
doi:10.1007/978-3-642-31623-4_3
fatcat:b7gnxodcqfgsfgj7an4aiptazm
A modal foundation for meta-variables
2003
Proceedings of the 2003 workshop on Mechanized reasoning about languages with variable binding - MERLIN '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We report on work in progress regarding a foundation for the notion of meta-variable in logical frameworks and type theories. ...
Our proposal is to treat meta-variables as modal variables in a modal type theory, which is logically clean and justifies several low-level implementation techniques for meta-variables. ...
However, at present we have not investigated the full theory of LF extended with firstclass abstractions over meta-variables. ...
doi:10.1145/976571.976582
dblp:conf/icfp/NanevskiPP03
fatcat:j5avipv5angovdghjekeuetaoe
Explicit Substitutions and Programming Languages
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
However, with explicit substitutions, it is possible to get finer properties with respect to gradual implementations of substitutions as effectively done in runtimes of programming languages. ...
The λ-calculus has been much used to study the theory of substitution in logical systems and programming languages. ...
Later several calculi were designed with full confluence [11] , or with both properties by suppressing some of the operations of explicit substitutions such as the composition of substitutions [4, 23 ...
doi:10.1007/3-540-46691-6_14
fatcat:tgwwga6f5naplivuaqer443thi
Pointers in Recursion: Exploring the Tropics
2019
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Pointer recursion with the safe/normal tiering discipline of Bellantoni and Cook corresponds to polylogtime computation. ...
Tropical tiering and pointer recursion, used with some of the most common recursion schemes, capture the classes logspace, logspace/polylogtime, ptime, and NC. ...
While the syntax of our tropical composition and recursion schemes may appear overwhelming at first sight, it has the nice feature, shared with the safe recursion functions of [3] , of only adding a fine ...
doi:10.4204/eptcs.298.3
fatcat:rpjuehj7ujhnxprahqddg3wzoe
Conformal gauge-Yukawa theories away from four dimensions
2016
Journal of High Energy Physics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We present the phase diagram and associated fixed points for a wide class of Gauge-Yukawa theories in d=4+ϵ dimensions. ...
We argue for a very rich phase diagram in three dimensions while in dimensions higher than four certain Gauge-Yukawa theories are ultraviolet complete because of the emergence of an asymptotically safe ...
This article is distributed under the terms of the Creative Commons Attribution License (CC-BY 4.0), which permits any use, distribution and reproduction in any medium, provided the original author(s) ...
doi:10.1007/jhep07(2016)118
fatcat:o5s5c7rkpvbzpebw42b3526ywm
Pointers in Recursion: Exploring the Tropics
2019
International Conference on Rewriting Techniques and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Pointer recursion with the safe/normal tiering discipline of Bellantoni and Cook corresponds to polylogtime computation. ...
Tropical tiering and pointer recursion, used with some of the most common recursion schemes, capture the classes logspace, logspace/polylogtime, ptime, and NC. ...
While the syntax of our tropical composition and recursion schemes may appear overwhelming at first sight, it has the nice feature, shared with the safe recursion functions of [3] , of only adding a fine ...
doi:10.4230/lipics.fscd.2019.29
dblp:conf/rta/Naurois19
fatcat:luamelc5zndx3mroazl7h5xhfa
An algebraic theory of interface automata
2014
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Outline Section 2 begins by introducing a trace-based theory of interface automata, and defines substitutive refinement, along with the collection of compositional operators. ...
We formulate a compositional specification theory for interface automata, where a component model specifies the allowed sequences of input and output interactions with the environment. ...
The authors are supported by EU FP7 project CON-NECT and ERC Advanced Grant VERIWARE. We would also like to thank the anonymous reviewers for their insightful comments. ...
doi:10.1016/j.tcs.2014.07.018
fatcat:vxk6ssm655dfbihkxrkyrjuerm
An Improved System of Intersection Types for Explicit Substitutions
[chapter]
2002
Foundations of Information Technology in the Era of Network and Mobile Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We characterize those terms which are strongly normalizing in a composition-free calculus of explicit substitutions by defining a suitable type system using intersection types. ...
The key idea is the notion of available variable in a term, which is a generalization of the classical notion of free variable. ...
Given the central place that strong normalization occupies in the theory and application of classical lambda calculus it is important to study this property in systems of explicit substitutions. ...
doi:10.1007/978-0-387-35608-2_42
dblp:conf/ifipTCS/DoughertyLL02
fatcat:q6dbejvcl5bgfnkviomwkw2cby
« Previous
Showing results 1 — 15 out of 37,673 results