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 91 matches
- 2015
- Henning Basold:
Dependent Inductive and Coinductive Types are Fibrational Dialgebras. FICS 2015: 3-17 - Angelos Charalambidis, Panos Rondogiannis, Ioanna Symeonidou:
Equivalence of two Fixed-Point Semantics for Definitional Higher-Order Logic Programs. FICS 2015: 18-32 - Naohi Eguchi:
Formalizing Termination Proofs under Polynomial Quasi-interpretations. FICS 2015: 33-47 - Zoltán Ésik, Uli Fahrenberg, Axel Legay:
*-Continuous Kleene ω-Algebras for Energy Problems. FICS 2015: 48-59 - Dilian Gurov, Minko Markov:
Self-Correlation and Maximum Independence in Finite Relations. FICS 2015: 60-74 - Makoto Hamana:
Iteration Algebras for UnQL Graphs and Completeness for Bisimulation. FICS 2015: 75-89 - Helle Hvid Hansen, Clemens Kupke:
Weak Completeness of Coalgebraic Dynamic Logics. FICS 2015: 90-104 - Martin Lange:
The Arity Hierarchy in the Polyadic μ-Calculus. FICS 2015: 105-116 - Karoliina Lehtinen:
Disjunctive form and the modal μ alternation hierarchy. FICS 2015: 117-131 - Étienne Lozes:
A Type-Directed Negation Elimination. FICS 2015: 132-142 - Paolo Torrini, Tom Schrijvers:
Reasoning about modular datatypes with Mendler induction. FICS 2015: 143-157 - Ralph Matthes, Matteo Mio:
Proceedings Tenth International Workshop on Fixed Points in Computer Science, FICS 2015, Berlin, Germany, September 11-12, 2015. EPTCS 191, 2015 [contents] - 2013
- Stefano Berardi, Ugo de'Liguoro:
Non-monotonic Pre-fixed Points and Learning. FICS 2013: 1-10 - Corina Cîrstea:
From Branching to Linear Time, Coalgebraically. FICS 2013: 11-27 - Niels Bjørn Bugge Grathwohl, Fritz Henglein, Dexter Kozen:
Infinitary Axiomatization of the Equational Theory of Context-Free Languages. FICS 2013: 44-55 - Eleftherios Matsikoudis, Edward A. Lee:
The Fixed-Point Theory of Strictly Contracting Functions on Generalized Ultrametric Semilattices. FICS 2013: 56-71 - Stefan Milius, Tadeusz Litak:
Guard Your Daggers and Traces: On The Equational Properties of Guarded (Co-)recursion. FICS 2013: 72-86 - Matteo Mio, Alex Simpson:
Łukasiewicz mu-Calculus. FICS 2013: 87-104 - José Espírito Santo, Ralph Matthes, Luís Pinto:
A Coinductive Approach to Proof Search. FICS 2013: 28-43 - David Baelde, Arnaud Carayol:
Proceedings Workshop on Fixed Points in Computer Science, FICS 2013, Turino, Italy, September 1st, 2013. EPTCS 126, 2013 [contents] - 2012
- Andreas Abel:
Type-Based Termination, Inflationary Fixed-Points, and Mixed Inductive-Coinductive Types. FICS 2012: 1-11 - Luca Aceto, Anna Ingólfsdóttir:
Characteristic Formulae for Relations with Nested Fixed Points. FICS 2012: 15-22 - Axel Haddad:
IO vs OI in Higher-Order Recursion Schemes. FICS 2012: 23-30 - André Hirschowitz, Marco Maggesi:
Initial Semantics for Strengthened Signatures. FICS 2012: 31-38 - Martin Lange, Étienne Lozes:
Model-Checking the Higher-Dimensional Modal mu-Calculus. FICS 2012: 39-46 - Grigori Mints, Thomas Studer:
Cut-elimination for the mu-calculus with one variable. FICS 2012: 47-54 - Tarmo Uustalu:
Structured general corecursion and coinductive graphs [extended abstract]. FICS 2012: 55-61 - Dale Miller, Zoltán Ésik:
Proceedings 8th Workshop on Fixed Points in Computer Science, FICS 2012, Tallinn, Estonia, 24th March 2012. EPTCS 77, 2012 [contents] - 2010
- Lars Birkedal, Jan Schwinghammer, Kristian Støvring:
A Metric Model of Lambda Calculus with Guarded Recursion. FICS 2010: 19-25 - Lars Birkedal, Jan Schwinghammer, Kristian Støvring:
A Step-Indexed Kripke Model of Hidden State via Recursive Properties on Recursively Defined Metric Spaces. FICS 2010: 27-33
skipping 61 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-12-11 19:16 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