default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 38 matches
- 2016
- Naoki Nishida, Adrián Palacios, Germán Vidal
:
Reversible Term Rewriting. FSCD 2016: 28:1-28:18 - Takahito Aoto, Yoshihito Toyama:
Ground Confluence Prover based on Rewriting Induction. FSCD 2016: 33:1-33:12 - Amal Ahmed:
Compositional Compiler Verification for a Multi-Language World. FSCD 2016: 1:1-1:1 - Ryota Akiyoshi, Kazushige Terui:
Strong Normalization for the Parameter-Free Polymorphic Lambda Calculus Based on the Omega-Rule.. FSCD 2016: 5:1-5:15 - Thorsten Altenkirch, Ambrus Kaposi:
Normalisation by Evaluation for Dependent Types. FSCD 2016: 6:1-6:16 - Ofer Arieli, Arnon Avron:
Minimal Paradefinite Logics for Reasoning with Incompleteness and Inconsistency. FSCD 2016: 7:1-7:15 - Ryuta Arisaka:
Structural Interactions and Absorption of Structural Rules in BI Sequent Calculus. FSCD 2016: 8:1-8:18 - Andrés Aristizábal, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk:
Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation. FSCD 2016: 9:1-9:17 - Martin Avanzini, Georg Moser:
Complexity of Acyclic Term Graph Rewriting. FSCD 2016: 10:1-10:18 - Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes-Sobrinho:
Nominal Narrowing. FSCD 2016: 11:1-11:17 - Krzysztof Bar, Aleks Kissinger, Jamie Vicary:
Globular: An Online Proof Assistant for Higher-Dimensional Rewriting. FSCD 2016: 34:1-34:11 - Marcin Benke, Aleksy Schubert, Daria Walukiewicz-Chrzaszcz:
Synthesis of Functional Programs with Help of First-Order Intuitionistic Logic. FSCD 2016: 12:1-12:16 - Valentin Blot:
Classical Extraction in Continuation Models. FSCD 2016: 13:1-13:17 - Jon Haël Brenas, Rachid Echahed, Martin Strecker:
Proving Correctness of Logically Decorated Graph Rewriting Systems. FSCD 2016: 14:1-14:15 - Flavien Breuvart, Giulio Manzonetto, Andrew Polonsky, Domenico Ruoppolo:
New Results on Morris's Observational Theory: The Benefits of Separating the Inseparable. FSCD 2016: 15:1-15:18 - Kaustuv Chaudhuri, Sonia Marin, Lutz Straßburger:
Modular Focused Proof Systems for Intuitionistic Modal Logics. FSCD 2016: 16:1-16:18 - Thierry Coquand, Bassel Mannaa:
The Independence of Markov's Principle in Type Theory. FSCD 2016: 17:1-17:18 - Andrej Dudenhefner, Moritz Martens, Jakob Rehof:
The Intersection Type Unification Problem. FSCD 2016: 19:1-19:16 - Stéphane Gimenez, David Obwaller:
Interaction Automata and the ia2d Interpreter. FSCD 2016: 35:1-35:11 - Giulio Guerrieri, Luc Pellissier, Lorenzo Tortora de Falco:
Computing Connected Proof(-Structure)s From Their Taylor Expansion. FSCD 2016: 20:1-20:18 - Makoto Hamana:
Strongly Normalising Cyclic Data Computation by Iteration Categories of Second-Order Algebraic Theories. FSCD 2016: 21:1-21:18 - Ichiro Hasuo:
Coalgebras and Higher-Order Computation: a GoI Approach. FSCD 2016: 2:1-2:2 - Gérard P. Huet:
Teaching Foundations of Computation and Deduction Through Literate Functional Programming and Type Theory Formalization. FSCD 2016: 3:1-3:2 - Stefan Kahrs, Connor Smith:
Non-Omega-Overlapping TRSs are UN. FSCD 2016: 22:1-22:17 - Cynthia Kop, Jakob Grue Simonsen:
Complexity Hierarchies and Higher-Order Cons-Free Rewriting. FSCD 2016: 23:1-23:18 - James Laird:
Weighted Relational Models for Mobility. FSCD 2016: 24:1-24:15 - Olivier Laurent:
Focusing in Orthologic. FSCD 2016: 25:1-25:17 - Tomer Libal, Dale Miller:
Functions-as-Constructors Higher-Order Unification. FSCD 2016: 26:1-26:17 - Philippe Malbos, Samuel Mimram:
Homological Computations for Term Rewriting Systems. FSCD 2016: 27:1-27:17 - Tobias Nipkow:
Verified Analysis of Functional Data Structures. FSCD 2016: 4:1-4:2
skipping 8 more matches
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 2025-01-01 04:43 CET 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
