Остановите войну!
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 24 matches
- 2001
- Peter Aczel:
The Russell-Prawitz modality. Math. Struct. Comput. Sci. 11(4): 541-554 (2001) - Roel Bloo:
Pure type systems with explicit substitution. Math. Struct. Comput. Sci. 11(1): 3-19 (2001) - Eduardo Bonelli:
Perpetuality in a named lambda calculus with explicit substitutions. Math. Struct. Comput. Sci. 11(1): 47-90 (2001) - Pierre-Louis Curien:
Preface to Locus Solum. Math. Struct. Comput. Sci. 11(3): 299-300 (2001) - René David, Bruno Guillaume:
A lambda-calculus with explicit weakening and explicit substitution. Math. Struct. Comput. Sci. 11(1): 169-206 (2001) - Joëlle Despeyroux, Pierre Leleu:
Recursion over objects of functional type. Math. Struct. Comput. Sci. 11(4): 555-572 (2001) - Gilles Dowek, Thérèse Hardin, Claude Kirchner:
HOL-λσ: an intentional first-order expression of higher-order logic. Math. Struct. Comput. Sci. 11(1): 21-45 (2001) - Manfred Droste, Dietrich Kuske:
Recognizable languages in divisibility monoids. Math. Struct. Comput. Sci. 11(6): 743-770 (2001) - Matt Fairtlough, Michael Mendler, Eugenio Moggi:
Special issue: Modalities in type theory. Math. Struct. Comput. Sci. 11(4): 507-509 (2001) - Mauro Ferrari, Camillo Fiorentini, Pierangelo Miglioli:
Extracting information from intermediate semiconstructive HA-systems - extended abstract. Math. Struct. Comput. Sci. 11(4): 589-596 (2001) - Jean-Yves Girard:
Locus Solum: From the rules of logic to the logic of rules. Math. Struct. Comput. Sci. 11(3): 301-506 (2001) - Annegret Habel, Jürgen Müller, Detlef Plump:
Double-pushout graph transformation revisited. Math. Struct. Comput. Sci. 11(5): 637-688 (2001) - Jacob M. Howe:
Proof search in Lax Logic. Math. Struct. Comput. Sci. 11(4): 573-588 (2001) - Yasuwo Ikeda, Kohji Tomita, Chiharu Hosono:
On the elimination of some higher type quantifiers. Math. Struct. Comput. Sci. 11(6): 771-779 (2001) - Max I. Kanovich, Jacqueline Vauzeilles:
The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity. Math. Struct. Comput. Sci. 11(6): 689-716 (2001) - Delia Kesner:
Theory and applications of explicit substitutions: Introduction. Math. Struct. Comput. Sci. 11(1): 1 (2001) - Giacomo Lenzi:
Mu-depth 3 is more than 2: a game-theoretic proof. Math. Struct. Comput. Sci. 11(2): 273-297 (2001) - François Métayer:
Implicit exchange in multiplicative proofnets. Math. Struct. Comput. Sci. 11(2): 261-272 (2001) - César A. Muñoz:
Dependent types and explicit substitutions: a meta-theoretical development. Math. Struct. Comput. Sci. 11(1): 91-129 (2001) - Frank Pfenning, Rowan Davies:
A judgmental reconstruction of modal logic. Math. Struct. Comput. Sci. 11(4): 511-540 (2001) - Peter Selinger:
Control categories and duality: on the categorical semantics of the lambda-mu calculus. Math. Struct. Comput. Sci. 11(2): 207-260 (2001) - René Vestergaard, J. B. Wells:
Cut rules and explicit substitutions. Math. Struct. Comput. Sci. 11(1): 131-168 (2001) - Steven Vickers:
Strongly algebraic = SFP (topically). Math. Struct. Comput. Sci. 11(6): 717-742 (2001) - Michal Walicki, Magne Haveraaen, Sigurd Meldal:
Computation Algebras. Math. Struct. Comput. Sci. 11(5): 597-636 (2001)
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-05-05 06:19 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