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
- 2009
- Andreas Abel, Thierry Coquand, Miguel Pagano:
A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance. TLCA 2009: 5-19 - Federico Aschieri, Stefano Berardi:
Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM1. TLCA 2009: 20-34 - Robert Atkey:
Syntax for Free: Representing Syntax with Binding Using Parametricity. TLCA 2009: 35-49 - Steven Awodey, Florian Rabe:
Kripke Semantics for Martin-Löf's Extensional Type Theory. TLCA 2009: 249-263 - Michele Basaldella, Kazushige Terui:
On the Meaning of Logical Completeness. TLCA 2009: 50-64 - Pierre Boudes:
Thick Subtrees, Games and Experiments. TLCA 2009: 65-79 - Claudia Faggian, Mauro Piccolo:
Partial Orders, Event Structures and Linear Strategies. TLCA 2009: 95-111 - Marcelo P. Fiore, Chung-Kil Hur:
Mathematical Synthesis of Equational Deduction Systems. TLCA 2009: 1-2 - Ken-etsu Fujita, Aleksy Schubert:
Existential Type Systems with No Types in Terms. TLCA 2009: 112-126 - Makoto Hamana:
Initial Algebra Semantics for Cyclic Sharing Structures. TLCA 2009: 127-141 - Robert Harper, Daniel R. Licata, Noam Zeilberger:
A Pronominal Approach to Binding and Computation. TLCA 2009: 3-4 - Hugo Herbelin, Stéphane Zimmermann:
An Operational Account of Call-by-Value Minimal and Classical lambda-Calculus in "Natural Deduction" Form. TLCA 2009: 142-156 - Ugo Dal Lago, Martin Hofmann:
Bounded Linear Logic, Revisited. TLCA 2009: 80-94 - William Lovas, Frank Pfenning:
Refinement Types as Proof Irrelevance. TLCA 2009: 157-171 - Peter LeFanu Lumsdaine:
Weak omega-Categories from Intensional Type Theory. TLCA 2009: 172-187 - Alexandre Miquel:
Relating Classical Realizability and Negative Translation for Existential Witness Extraction. TLCA 2009: 188-202 - Dimitris Mostrous, Nobuko Yoshida:
Session-Based Communication Optimisation for Higher-Order Mobile Processes. TLCA 2009: 203-218 - Michele Pagani:
The Cut-Elimination Theorem for Differential Nets with Promotion. TLCA 2009: 219-233 - Barbara Petit:
A Polymorphic Type System for the Lambda-Calculus with Constructors. TLCA 2009: 234-248 - Colin Riba:
On the Values of Reducibility Candidates. TLCA 2009: 264-278 - Jeffrey Sarnat, Carsten Schürmann:
Lexicographic Path Induction. TLCA 2009: 279-293 - Florian Stenger, Janis Voigtländer:
Parametricity for Haskell with Imprecise Error Semantics. TLCA 2009: 294-308 - Lutz Straßburger:
Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic. TLCA 2009: 309-324 - Christine Tasson:
Algebraic Totality, towards Completeness. TLCA 2009: 325-340 - Takeshi Tsukada, Atsushi Igarashi:
A Logical Foundation for Environment Classifiers. TLCA 2009: 341-355 - Pawel Urzyczyn:
Inhabitation of Low-Rank Intersection Types. TLCA 2009: 356-370 - Lionel Vaux:
Differential Linear Logic and Polarization. TLCA 2009: 371-385 - Gunnar Wilken, Andreas Weiermann:
Complexity of Gödel's T in lambda-Formulation. TLCA 2009: 386-400 - Yu Zhang:
The Computational SLR: A Logic for Reasoning about Computational Indistinguishability. TLCA 2009: 401-415 - Pierre-Louis Curien:
Typed Lambda Calculi and Applications, 9th International Conference, TLCA 2009, Brasilia, Brazil, July 1-3, 2009. Proceedings. Lecture Notes in Computer Science 5608, Springer 2009, ISBN 978-3-642-02272-2 [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-09-25 10:40 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