![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 28 matches
- 1999
- Jean Paul Bahsoun, José Luiz Fiadeiro, Didier Galmiche:
Foreword. Math. Struct. Comput. Sci. 9(3): 225-226 (1999) - Inge Bethke, Jan Willem Klop, Roel C. de Vrijer:
Extending partial combinatory algebras. Math. Struct. Comput. Sci. 9(4): 483-505 (1999) - Gérard Boudol, Pierre-Louis Curien, Carolina Lavatelli:
A semantics for lambda calculi with resources. Math. Struct. Comput. Sci. 9(4): 437-482 (1999) - Venanzio Capretta, Silvio Valentini:
A general method for proving the normalization theorem for first and second order typed lambda-calculi. Math. Struct. Comput. Sci. 9(6): 719-739 (1999) - Thierry Coquand, Martin Hofmann:
A new method for establishing conservativity of classical systems over their intuitionistic version. Math. Struct. Comput. Sci. 9(4): 323-333 (1999) - Felix Cornelius, Michael Baldamus, Hartmut Ehrig, Fernando Orejas:
Abstract and behaviour module specifications. Math. Struct. Comput. Sci. 9(1): 21-62 (1999) - Roy L. Crole, Andrew D. Gordon:
Relating operational and denotational semantics for input/output effects. Math. Struct. Comput. Sci. 9(2): 125-158 (1999) - Ferruccio Damiani, Mariangiola Dezani-Ciancaglini, Paola Giannini:
A filter model for mobile processes. Math. Struct. Comput. Sci. 9(1): 63-101 (1999) - Norman Danner, Daniel Leivant:
Stratified polymorphism and primitive recursion. Math. Struct. Comput. Sci. 9(4): 507-522 (1999) - Giorgio Delzanno, Didier Galmiche, Maurizio Martelli:
A specification logic for concurrent object-oriented programming. Math. Struct. Comput. Sci. 9(3): 253-286 (1999) - Mariangiola Dezani-Ciancaglini, Giuseppe Longo, Jonathan P. Seldin:
Preface. Math. Struct. Comput. Sci. 9(4): 321 (1999) - Gilles Dowek:
Collections, sets and types. Math. Struct. Comput. Sci. 9(1): 109-123 (1999) - Carlos H. C. Duarte:
Proof-theoretic foundations for the design of actor systems. Math. Struct. Comput. Sci. 9(3): 227-252 (1999) - Abbas Edalat:
Semi-pullbacks and bisimulation in categories of Markov processes. Math. Struct. Comput. Sci. 9(5): 523-543 (1999) - Herman Geuvers, Erik Barendsen:
Some logical and syntactical observations concerning the first-order dependent type system lambda-P. Math. Struct. Comput. Sci. 9(4): 335-359 (1999) - Joseph A. Goguen, Grant Malcolm:
Hidden coinduction: behavioural correctness proofs for objects. Math. Struct. Comput. Sci. 9(3): 287-319 (1999) - Furio Honsell, Marina Lenisa:
Coinductive characterizations of applicative structures. Math. Struct. Comput. Sci. 9(4): 403-435 (1999) - Stefano Kasangian, Anna Labella:
Observational trees as models for concurrency. Math. Struct. Comput. Sci. 9(6): 687-718 (1999) - Lawrence C. Paulson:
Final coalgebras as greatest fixed points in ZF set theory. Math. Struct. Comput. Sci. 9(5): 545-567 (1999) - Jan von Plato:
Order in open intervals of computable reals. Math. Struct. Comput. Sci. 9(1): 103-108 (1999) - Gordon D. Plotkin:
Full abstraction, totality and PCF. Math. Struct. Comput. Sci. 9(1): 1-20 (1999) - Alberto Pravato, Simona Ronchi Della Rocca, Luca Roversi:
The call-by-value [lambda]-calculus: a semantic investigation. Math. Struct. Comput. Sci. 9(5): 617-650 (1999) - Bernhard Reus, Thomas Streicher:
General synthetic domain theory - a logical approach. Math. Struct. Comput. Sci. 9(2): 177-223 (1999) - Jon G. Riecke, Ramesh Subrahmanyam:
Conditions for the completeness of functional and algebraic equational reasoning. Math. Struct. Comput. Sci. 9(6): 651-685 (1999) - Davide Sangiorgi:
From lambda to pi; or, Rediscovering continuations. Math. Struct. Comput. Sci. 9(4): 367-401 (1999) - Richard Statman:
On the existence of n but not n + 1 easy combinators. Math. Struct. Comput. Sci. 9(4): 361-365 (1999) - Vera Trnková, Jirí Velebil:
On categories generalizing universal domains. Math. Struct. Comput. Sci. 9(2): 159-175 (1999) - Steven Vickers:
Topical categories of domains. Math. Struct. Comput. Sci. 9(5): 569-616 (1999)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-14 23:26 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