default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th MFPS 1995: New Orleans, LA, USA
- Stephen D. Brookes, Michael G. Main, Austin Melton, Michael W. Mislove:
Eleventh Annual Conference on Mathematical Foundations of Programming Semantics, MFPS 1995, Tulane University, New Orleans, LA, USA, March 29 - April 1, 1995. Electronic Notes in Theoretical Computer Science 1, Elsevier 1995 - Fabio Alessi, Paolo Baldan, Gianna Bellè, Jan J. M. M. Rutten:
Solutions of functorial and non-functorial metric domain equations. 1-12 - Karen L. Bernstein, Eugene W. Stark:
Operational semantics of a focusing debugger. 13-31 - Gérard Boudol, Cosimo Laneve
:
Termination, deadlock and divergence in the lambda-calculus with multiplicities. 32-45 - J. Robin B. Cockett, David A. Spooner:
Categories for synchrony and asynchrony. 66-90 - Krishna Kishore Dhara, Gary T. Leavens:
Weak behavioral subtyping for types with mutable objects. 91-113 - Abbas Edalat:
Domain theory in learning processes. 114-131 - Jonathan Eifrig, Scott F. Smith, Valery Trifonov:
Type inference for recursively constrained types and its application to OOP. 132-153 - Zoltán Ésik, L. Bernátsky:
Scott induction and equational proofs. 154-181 - Bob Flagg, Ralph Kopperman:
Fixed points and reflexive domain equations in categories of continuity spaces. 182-198 - Peter J. Freyd, Peter W. O'Hearn, John Power, Robert D. Tennent, Makoto Takeyama:
Bireflectivity. 199-213 - Philippa Gardner:
A name-free account of action calculi. 214-231 - Andrew D. Gordon:
Bisimilarity as a theory of functional programming. 232-252 - Douglas N. Hoover:
Maximal limit spaces, powerspaces, and Scott domains. 253-272 - Bart Jacobs:
Subtypes and bounded quantification from a fibred perspective. 273-289 - Alan Jeffrey:
A fully abstract semantics for a nondeterministic functional language with monadic types. 290-301 - Cliff B. Jones:
Granularity and the development of concurrent programs. 302-306 - Cliff B. Jones:
Fixing the semantics of some concurrent object-oriented concepts. 307-312 - Neil D. Jones:
Complexity and computability from a programming language perspective. 313-333 - Achim Jung, Hermann Puhlmann:
Types, logic and semantics for nested databases. 334-354 - François Lamarche:
Generalizing coherent domains and hypercoherences. 355-369 - John Maraist, Martin Odersky, David N. Turner, Philip Wadler:
Call-by-name, call-by-value, call-by-need and the linear lambda calculus. 370-392 - Michael W. Mislove:
Denotational models for unbounded nondeterminism. 393-410 - Ugo Montanari, Marco Pistore:
Concurrent semantics for the pi-calculus. 411-429 - Kay-Jeannette Nüssler:
Universality and powerdomains. 430-446 - Peter W. O'Hearn, John Power, Robert D. Tennent, Makoto Takeyama:
Syntactic control of interference revisited. 447-486 - Peter W. O'Hearn, Uday S. Reddy:
Objects, interference and the Yoneda embedding. 487-514 - Frank Pfenning, Hao-Chi Wong:
On a modal lambda calculus for S4. 515-534 - Michel P. Schellekens:
The Smyth completion: a common foundation for denotational semantics and complexity analysis. 535-556 - Stephen D. Brookes, Michael G. Main, Austin Melton, Michael W. Mislove:
Foreword and Dedication. 557-558
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
