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 321 matches
- 2024
- Takahito Aoto, Naoki Nishida, Jonas Schöpf
:
Equational Theories and Validity for Logically Constrained Term Rewriting. FSCD 2024: 31:1-31:21 - Junyoung Jang, Sophia Roshal, Frank Pfenning, Brigitte Pientka:
Adjoint Natural Deduction. FSCD 2024: 15:1-15:23 - Sebastian Ullrich:
Lean: Past, Present, and Future (Invited Talk). FSCD 2024: 3:1-3:2 - Samson Abramsky, Serban-Ion Cercelescu, Carmen-Maria Constantin:
Commutation Groups and State-Independent Contextuality. FSCD 2024: 28:1-28:20 - Beniamino Accattoli, Claudio Sacerdoti Coen:
IMELL Cut Elimination with Linear Overhead. FSCD 2024: 24:1-24:24 - Beniamino Accattoli, Adrienne Lancelot:
Mirroring Call-By-Need, or Values Acting Silly. FSCD 2024: 23:1-23:24 - Franz Baader, Jürgen Giesl:
On the Complexity of the Small Term Reachability Problem for Terminating Term Rewriting Systems. FSCD 2024: 16:1-16:18 - Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Alan Schmitt:
Optimizing a Non-Deterministic Abstract Machine with Environments. FSCD 2024: 11:1-11:22 - Filip Cano, Thomas A. Henzinger, Bettina Könighofer, Konstantin Kueffner, Kaushik Mallik:
Abstraction-Based Decision Making for Statistical Properties (Invited Talk). FSCD 2024: 2:1-2:17 - Camil Champin, Samuel Mimram, Émile Oleon:
Delooping Generated Groups in Homotopy Type Theory. FSCD 2024: 6:1-6:20 - Kostia Chardonnet, Louis Lemonnier, Benoît Valiron:
Semantics for a Turing-Complete Reversible Programming Language with Inductive Types. FSCD 2024: 19:1-19:19 - Nathan Corbyn, Lukas Heidemann, Nick Hu, Chiara Sarti, Calin Tataru, Jamie Vicary:
homotopy.io: A Proof Assistant for Finitely-Presented Globular n-Categories. FSCD 2024: 30:1-30:26 - Pablo Donato:
The Flower Calculus. FSCD 2024: 5:1-5:24 - Maximilian Doré, Evan Cavallo, Anders Mörtberg:
Automating Boundary Filling in Cubical Agda. FSCD 2024: 22:1-22:18 - Andrej Dudenhefner, Daniele Pautasso:
Mechanized Subject Expansion in Uniform Intersection Types for Perpetual Reductions. FSCD 2024: 8:1-8:20 - Aloÿs Dufour, Damiano Mazza:
Böhm and Taylor for All! FSCD 2024: 29:1-29:20 - Thiago Felicissimo, Théo Winterhalter:
Impredicativity, Cumulativity and Product Covariance in the Logical Framework Dedukti. FSCD 2024: 21:1-21:23 - Tao Gu, Jialu Bao, Justin Hsu, Alexandra Silva, Fabio Zanasi:
A Categorical Approach to DIBI Models. FSCD 2024: 17:1-17:20 - Benoît Guillemet, Assia Mahboubi, Matthieu Piquerez:
Machine-Checked Categorical Diagrammatic Reasoning. FSCD 2024: 7:1-7:19 - Hugo Herbelin, Jad Koleilat:
On the Logical Structure of Some Maximality and Well-Foundedness Principles Equivalent to Choice Principles. FSCD 2024: 26:1-26:15 - Sohei Ito, Makoto Tatsuta:
Representation of Peano Arithmetic in Separation Logic. FSCD 2024: 18:1-18:17 - Ambrus Kaposi, Szumi Xie:
Second-Order Generalised Algebraic Theories: Signatures and First-Order Semantics. FSCD 2024: 10:1-10:24 - Georgios Alexandros Kavvos:
Two-Dimensional Kripke Semantics I: Presheaves. FSCD 2024: 14:1-14:23 - Marie Kerjean, Jean-Simon Pacaud Lemay:
Laplace Distributors and Laplace Transformations for Differential Categories. FSCD 2024: 9:1-9:21 - Delia Kesner, Victor Arrial, Giulio Guerrieri:
Meaningfulness and Genericity in a Subsuming Framework (Invited Talk). FSCD 2024: 1:1-1:24 - Salvador Lucas:
Termination of Generalized Term Rewriting Systems. FSCD 2024: 32:1-32:18 - Ralph Matthes, Kobe Wullaert, Benedikt Ahrens:
Substitution for Non-Wellfounded Syntax with Binders Through Monoidal Categories. FSCD 2024: 25:1-25:22 - Mateus de Oliveira Oliveira, Farhad Vadiee:
State Canonization and Early Pruning in Width-Based Automated Theorem Proving. FSCD 2024: 33:1-33:17 - Teppei Saito, Nao Hirokawa:
Simulating Dependency Pairs by Semantic Labeling. FSCD 2024: 13:1-13:20 - Victor Sannier, Patrick Baillot:
A Linear Type System for Lp-Metric Sensitivity Analysis. FSCD 2024: 12:1-12:22
skipping 291 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 2024-11-25 13:22 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:
