Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 30 matches
- 1995
- Fabio Alessi, Paolo Baldan, Gianna Bellè, Jan J. M. M. Rutten:
Solutions of functorial and non-functorial metric domain equations. MFPS 1995: 1-12 - Karen L. Bernstein, Eugene W. Stark:
Operational semantics of a focusing debugger. MFPS 1995: 13-31 - Gérard Boudol, Cosimo Laneve:
Termination, deadlock and divergence in the lambda-calculus with multiplicities. MFPS 1995: 32-45 - Stephen D. Brookes, Michael G. Main, Austin Melton, Michael W. Mislove:
Foreword and Dedication. MFPS 1995: 557-558 - J. Robin B. Cockett, David A. Spooner:
Categories for synchrony and asynchrony. MFPS 1995: 66-90 - Krishna Kishore Dhara, Gary T. Leavens:
Weak behavioral subtyping for types with mutable objects. MFPS 1995: 91-113 - Abbas Edalat:
Domain theory in learning processes. MFPS 1995: 114-131 - Jonathan Eifrig, Scott F. Smith, Valery Trifonov:
Type inference for recursively constrained types and its application to OOP. MFPS 1995: 132-153 - Zoltán Ésik, L. Bernátsky:
Scott induction and equational proofs. MFPS 1995: 154-181 - Bob Flagg, Ralph Kopperman:
Fixed points and reflexive domain equations in categories of continuity spaces. MFPS 1995: 182-198 - Peter J. Freyd, Peter W. O'Hearn, John Power, Robert D. Tennent, Makoto Takeyama:
Bireflectivity. MFPS 1995: 199-213 - Philippa Gardner:
A name-free account of action calculi. MFPS 1995: 214-231 - Andrew D. Gordon:
Bisimilarity as a theory of functional programming. MFPS 1995: 232-252 - Douglas N. Hoover:
Maximal limit spaces, powerspaces, and Scott domains. MFPS 1995: 253-272 - Bart Jacobs:
Subtypes and bounded quantification from a fibred perspective. MFPS 1995: 273-289 - Alan Jeffrey:
A fully abstract semantics for a nondeterministic functional language with monadic types. MFPS 1995: 290-301 - Cliff B. Jones:
Granularity and the development of concurrent programs. MFPS 1995: 302-306 - Cliff B. Jones:
Fixing the semantics of some concurrent object-oriented concepts. MFPS 1995: 307-312 - Neil D. Jones:
Complexity and computability from a programming language perspective. MFPS 1995: 313-333 - Achim Jung, Hermann Puhlmann:
Types, logic and semantics for nested databases. MFPS 1995: 334-354 - François Lamarche:
Generalizing coherent domains and hypercoherences. MFPS 1995: 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. MFPS 1995: 370-392 - Michael W. Mislove:
Denotational models for unbounded nondeterminism. MFPS 1995: 393-410 - Ugo Montanari, Marco Pistore:
Concurrent semantics for the pi-calculus. MFPS 1995: 411-429 - Kay-Jeannette Nüssler:
Universality and powerdomains. MFPS 1995: 430-446 - Peter W. O'Hearn, John Power, Robert D. Tennent, Makoto Takeyama:
Syntactic control of interference revisited. MFPS 1995: 447-486 - Peter W. O'Hearn, Uday S. Reddy:
Objects, interference and the Yoneda embedding. MFPS 1995: 487-514 - Frank Pfenning, Hao-Chi Wong:
On a modal lambda calculus for S4. MFPS 1995: 515-534 - Michel P. Schellekens:
The Smyth completion: a common foundation for denotational semantics and complexity analysis. MFPS 1995: 535-556 - 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 [contents]
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-25 23:21 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint