default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRalph Matthes
Person information
- affiliation: IRIT, Toulouse, France
- affiliation: Ludwig Maximilian University of Munich, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c32]Benedikt Ahrens
, Ralph Matthes, Niels van der Weide, Kobe Wullaert:
Displayed Monoidal Categories for the Semantics of Linear Logic. CPP 2024: 260-273- [c31]Ralph Matthes, Kobe Wullaert, Benedikt Ahrens:
Substitution for Non-Wellfounded Syntax with Binders Through Monoidal Categories. FSCD 2024: 25:1-25:22 - 2023
- [i9]Benedikt Ahrens, Ralph Matthes, Kobe Wullaert:
Formalizing Monoidal Categories and Actions for Syntax with Binders. CoRR abs/2307.16270 (2023) - [i8]Ralph Matthes, Kobe Wullaert, Benedikt Ahrens:
Substitution for Non-Wellfounded Syntax with Binders. CoRR abs/2308.05485 (2023) - 2022
- [c30]Benedikt Ahrens, Ralph Matthes, Anders Mörtberg:
Implementing a category-theoretic framework for typed abstract syntax. CPP 2022: 307-323 - [c29]Kobe Wullaert, Ralph Matthes, Benedikt Ahrens:
Univalent Monoidal Categories. TYPES 2022: 15:1-15:21 - [i7]Kobe Wullaert, Ralph Matthes, Benedikt Ahrens:
Univalent Monoidal Categories. CoRR abs/2212.03146 (2022) - 2021
- [j19]José Espírito Santo, Ralph Matthes, Luís Pinto:
A coinductive approach to proof search through typed lambda-calculi. Ann. Pure Appl. Log. 172(10): 103026 (2021) - [i6]Benedikt Ahrens, Ralph Matthes, Anders Mörtberg:
Implementing a Category-Theoretic Framework for Typed Abstract Syntax. CoRR abs/2112.06984 (2021) - 2020
- [c28]José Espírito Santo, Ralph Matthes, Luís Pinto:
Coinductive Proof Search for Polarized Logic with Applications to Full Intuitionistic Propositional Logic. TYPES 2020: 4:1-4:24 - [i5]José Espírito Santo, Ralph Matthes, Luís Pinto:
Proof search for full intuitionistic propositional logic through a coinductive approach for polarized logic. CoRR abs/2007.16161 (2020)
2010 – 2019
- 2019
- [j18]José Espírito Santo, Ralph Matthes, Luís Pinto:
Decidability of Several Concepts of Finiteness for Simple Types. Fundam. Informaticae 170(1-3): 111-138 (2019) - [j17]Benedikt Ahrens, Ralph Matthes, Anders Mörtberg:
From Signatures to Monads in UniMath. J. Autom. Reason. 63(2): 285-318 (2019) - [j16]José Espírito Santo, Ralph Matthes, Luís Pinto:
Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search. Math. Struct. Comput. Sci. 29(8): 1092-1124 (2019) - [c27]Dominique Larchey-Wendling, Ralph Matthes:
Certification of Breadth-First Algorithms by Extraction. MPC 2019: 45-75 - 2018
- [c26]Ulrich Berger, Ralph Matthes, Anton Setzer:
Martin Hofmann's Case for Non-Strictly Positive Data Types. TYPES 2018: 1:1-1:22 - 2017
- [j15]David Baelde, Arnaud Carayol, Ralph Matthes, Igor Walukiewicz:
Preface. Fundam. Informaticae 150(3-4): i-ii (2017) - 2016
- [i4]Benedikt Ahrens, Ralph Matthes:
Heterogeneous substitution systems revisited. CoRR abs/1601.04299 (2016) - [i3]José Espírito Santo, Ralph Matthes, Luís Pinto:
A Coinductive Approach to Proof Search through Typed Lambda-Calculi. CoRR abs/1602.04382 (2016) - [i2]José Espírito Santo, Ralph Matthes, Luís Pinto:
Inhabitation in Simply-Typed Lambda-Calculus through a Lambda-Calculus for Proof Search. CoRR abs/1604.02086 (2016) - [i1]Benedikt Ahrens, Ralph Matthes, Anders Mörtberg:
From signatures to monads in UniMath. CoRR abs/1612.00693 (2016) - 2015
- [c25]Benedikt Ahrens, Ralph Matthes:
Heterogeneous Substitution Systems Revisited. TYPES 2015: 2:1-2:23 - [e3]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] - 2014
- [c24]José Espírito Santo, Ralph Matthes, Koji Nakazawa, Luís Pinto:
Confluence for classical logic through the distinction between values and computations. CL&C 2014: 63-77 - [e2]Ralph Matthes, Aleksy Schubert:
19th International Conference on Types for Proofs and Programs, TYPES 2013, April 22-26, 2013, Toulouse, France. LIPIcs 26, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2014, ISBN 978-3-939897-72-9 [contents] - 2013
- [j14]Ralph Matthes, Tarmo Uustalu:
Preface. RAIRO Theor. Informatics Appl. 47(1): 1-2 (2013) - [j13]José Espírito Santo, Ralph Matthes, Koji Nakazawa, Luís Pinto:
Monadic translation of classical sequent calculus. Math. Struct. Comput. Sci. 23(6): 1111-1162 (2013) - [c23]Mathias Winckel, Ralph Matthes:
On a Dynamic Logic for Graph Rewriting. ICTERI 2013: 506-520 - [c22]José Espírito Santo, Ralph Matthes, Luís Pinto:
A Coinductive Approach to Proof Search. FICS 2013: 28-43 - 2012
- [j12]Ralph Matthes, Sergei Soloviev:
Preface to the special issue: commutativity of algebraic diagrams. Math. Struct. Comput. Sci. 22(6): 901-903 (2012) - [c21]Célia Picard, Ralph Matthes:
Permutations in Coinductive Graph Representation. CMCS 2012: 218-237 - 2011
- [j11]Célia Picard, Ralph Matthes:
Coinductive Graph Representation: the Problem of Embedded Lists. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 39 (2011) - [j10]Ralph Matthes:
Map fusion for nested datatypes in intensional type theory. Sci. Comput. Program. 76(3): 204-224 (2011) - [c20]Ralph Matthes, Célia Picard:
Verification of redecoration for infinite triangular matrices using coinduction. TYPES 2011: 55-69 - 2010
- [c19]Mathieu Giorgino, Martin Strecker, Ralph Matthes, Marc Pantel:
Verification of the Schorr-Waite Algorithm - From Trees to Graphs. LOPSTR 2010: 67-83
2000 – 2009
- 2009
- [j9]José Espírito Santo, Ralph Matthes, Luís Pinto:
Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi. Log. Methods Comput. Sci. 5(2) (2009) - [j8]Ralph Matthes:
An induction principle for nested datatypes in intensional type theory. J. Funct. Program. 19(3-4): 439-468 (2009) - [e1]Ralph Matthes, Tarmo Uustalu:
6th Workshop on Fixed Points in Computer Science, FICS 2009, Coimbra, Portugal, September 12-13, 2009. Institute of Cybernetics 2009, ISBN 978-9949-430-29-1 [contents] - 2008
- [j7]Ralph Matthes, Sergei Soloviev:
Preface to the special issue: isomorphisms of types and invertibility of lambda terms. Math. Struct. Comput. Sci. 18(4): 645-646 (2008) - [c18]Ralph Matthes:
Recursion on Nested Datatypes in Dependent Type Theory. CiE 2008: 431-446 - [c17]Ralph Matthes:
Nested Datatypes with Generalized Mendler Iteration: Map Fusion and the Example of the Representation of Untyped Lambda Calculus with Explicit Flattening. MPC 2008: 220-242 - [c16]José Espírito Santo, Ralph Matthes, Luís Pinto:
Monadic Translation of Intuitionistic Sequent Calculus. TYPES 2008: 100-116 - 2007
- [c15]José Espírito Santo, Ralph Matthes, Luís Pinto:
Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi. TLCA 2007: 133-147 - [c14]Ralph Matthes, Martin Strecker:
Verification of the Redecoration Algorithm for Triangular Matrices. TYPES 2007: 125-141 - 2006
- [c13]Ralph Matthes:
A Datastructure for Iterated Powers. MPC 2006: 299-315 - [c12]Ralph Matthes:
Verification of Programs on Truly Nested Datatypes in Intensional Type Theory. MSFP@MPC 2006 - 2005
- [j6]Ralph Matthes:
Non-strictly positive fixed points for classical natural deduction. Ann. Pure Appl. Log. 133(1-3): 205-230 (2005) - [j5]Andreas Abel, Ralph Matthes, Tarmo Uustalu:
Iteration and coiteration schemes for higher-order and nested datatypes. Theor. Comput. Sci. 333(1-2): 3-66 (2005) - 2004
- [j4]Ralph Matthes, Tarmo Uustalu:
Substitution in non-wellfounded syntax with variable binding. Theor. Comput. Sci. 327(1-2): 155-174 (2004) - [c11]Andreas Abel, Ralph Matthes:
Fixed Points of Type Constructors and Primitive Recursion. CSL 2004: 190-204 - 2003
- [j3]Felix Joachimski, Ralph Matthes:
Short proofs of normalization for the simply- typed lambda-calculus, permutative conversions and Go"del's T. Arch. Math. Log. 42(1): 59-87 (2003) - [c10]Andreas Abel, Ralph Matthes:
Primitive Recursion for Rank-2 Inductive Types. FICS 2003: 1-3 - [c9]Andreas Abel, Ralph Matthes, Tarmo Uustalu:
Generalized Iteration and Coiteration for Higher-Order Nested Datatypes. FoSSaCS 2003: 54-69 - [c8]Ralph Matthes, Tarmo Uustalu:
Substitution in Non-wellfounded Syntax with Variable Binding. CMCS 2003: 191-205 - 2002
- [j2]Ralph Matthes:
Tarski's Fixed-Point Theorem And Lambda Calculi With Monotone Inductive Types. Synth. 133(1-2): 107-129 (2002) - [c7]Andreas Abel, Ralph Matthes:
(Co-)Iteration for Higher-Order Nested Datatypes. TYPES 2002: 1-20 - 2001
- [c6]Ralph Matthes:
Monotone Inductive and Coinductive Constructors of Rank 2. CSL 2001: 600-614 - [c5]Ralph Matthes:
Interpolation for Natural Deduction with Generalized Eliminations. Proof Theory in Computer Science 2001: 153-169 - [c4]Ralph Matthes:
Parigot's Second Order lambda-mu-Calculus and Inductive Types. TLCA 2001: 329-343 - 2000
- [c3]Ralph Matthes:
Characterizing Strongly Normalizing Terms of a Calculus with Generalized Applications via Intersection Types. ICALP Satellite Workshops 2000: 339-354 - [c2]Felix Joachimski, Ralph Matthes:
Standardization and Confluence for a Lambda Calculus with Generalized Applications. RTA 2000: 141-155
1990 – 1999
- 1999
- [b1]Ralph Matthes:
Extensions of system F by iteration and primitive recursion on monotone inductive types. Ludwig Maximilian University of Munich, Germany, Utz 1999, ISBN 978-3-89675-578-0, pp. 1-185 - [j1]Ralph Matthes:
Monotone (co)inductive types and positive fixed-point types. RAIRO Theor. Informatics Appl. 33(4/5): 309-328 (1999) - 1998
- [c1]Ralph Matthes:
Monotone Fixed-Point Types and Strong Normalization. CSL 1998: 298-312
Coauthor Index
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.
last updated on 2024-10-07 21:20 CEST 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:
