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 19 matches
- 2013
- Ki Yung Ahn, Tim Sheard, Marcelo P. Fiore, Andrew M. Pitts:
System F i . TLCA 2013: 15-30 - Federico Aschieri, Margherita Zorzi:
Non-determinism, Non-termination and the Strong Normalization of System T. TLCA 2013: 31-47 - Nick Benton, Martin Hofmann, Vivek Nigam:
Proof-Relevant Logical Relations for Name Generation. TLCA 2013: 48-60 - Stefano Berardi, Makoto Tatsuta:
Games with Sequential Backtracking and Complete Game Semantics for Subclassical Logics. TLCA 2013: 61-76 - Valentin Blot:
Realizability for Peano Arithmetic with Winning Conditions in HON Games. TLCA 2013: 77-92 - Flavien Breuvart:
The Resource Lambda Calculus Is Short-Sighted in Its Relational Model. TLCA 2013: 93-108 - Pierre Clairambault:
Bounding Skeletons, Locally Scoped Terms and Exact Bounds for Linear Head Reduction. TLCA 2013: 109-124 - Boris Düdder, Moritz Martens, Jakob Rehof:
Intersection Type Matching with Subtyping. TLCA 2013: 125-139 - Daniel Fridlender, Miguel Pagano:
A Type-Checking Algorithm for Martin-Löf Type Theory with Subtyping Based on Normalisation by Evaluation. TLCA 2013: 140-155 - Peter G. Hancock, Conor McBride, Neil Ghani, Lorenzo Malatesta, Thorsten Altenkirch:
Small Induction Recursion. TLCA 2013: 156-172 - Hugo Herbelin:
Proving with Side Effects. TLCA 2013: 2 - Nicolai Kraus, Martín Hötzel Escardó, Thierry Coquand, Thorsten Altenkirch:
Generalizations of Hedberg's Theorem. TLCA 2013: 173-188 - Damiano Mazza:
Non-linearity as the Metric Completion of Linearity. TLCA 2013: 3-14 - Simon L. Peyton Jones:
Type-Directed Compilation in the Wild: Haskell and Core. TLCA 2013: 1 - Sylvain Salvati, Igor Walukiewicz:
Using Models to Model-Check Recursive Schemes. TLCA 2013: 189-204 - Ulrich Schöpp:
On Interaction, Continuations and Defunctionalization. TLCA 2013: 205-220 - Paula Severi, Fer-Jan de Vries:
Completeness of Conversion between Reactive Programs for Ultrametric Models. TLCA 2013: 221-235 - Chuangjie Xu, Martín Hötzel Escardó:
A Constructive Model of Uniform Continuity. TLCA 2013: 236-249 - Masahito Hasegawa:
Typed Lambda Calculi and Applications, 11th International Conference, TLCA 2013, Eindhoven, The Netherlands, June 26-28, 2013. Proceedings. Lecture Notes in Computer Science 7941, Springer 2013, ISBN 978-3-642-38945-0 [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-10-19 18:10 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