The SCEAS System
| |||||||

## Search the dblp DataBase
Ralph Matthes:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Andreas Abel, Ralph Matthes
**Fixed Points of Type Constructors and Primitive Recursion.**[Citation Graph (0, 0)][DBLP] CSL, 2004, pp:190-204 [Conf] - Ralph Matthes
**Monotone Inductive and Coinductive Constructors of Rank 2.**[Citation Graph (0, 0)][DBLP] CSL, 2001, pp:600-614 [Conf] - Ralph Matthes
**Monotone Fixed-Point Types and Strong Normalization.**[Citation Graph (0, 0)][DBLP] CSL, 1998, pp:298-312 [Conf] - Ralph Matthes
**Interpolation for Natural Deduction with Generalized Eliminations.**[Citation Graph (0, 0)][DBLP] Proof Theory in Computer Science, 2001, pp:153-169 [Conf] - Andreas Abel, Ralph Matthes, Tarmo Uustalu
**Generalized Iteration and Coiteration for Higher-Order Nested Datatypes.**[Citation Graph (0, 0)][DBLP] FoSSaCS, 2003, pp:54-69 [Conf] - Ralph Matthes
**Characterizing Strongly Normalizing Terms of a Calculus with Generalized Applications via Intersection Types.**[Citation Graph (0, 0)][DBLP] ICALP Satellite Workshops, 2000, pp:339-354 [Conf] - Ralph Matthes
**A Datastructure for Iterated Powers.**[Citation Graph (0, 0)][DBLP] MPC, 2006, pp:299-315 [Conf] - Felix Joachimski, Ralph Matthes
**Standardization and Confluence for a Lambda Calculus with Generalized Applications.**[Citation Graph (0, 0)][DBLP] RTA, 2000, pp:141-155 [Conf] - Ralph Matthes
**Parigot's Second Order lambda-mu-Calculus and Inductive Types.**[Citation Graph (0, 0)][DBLP] TLCA, 2001, pp:329-343 [Conf] - Andreas Abel, Ralph Matthes
**(Co-)Iteration for Higher-Order Nested Datatypes.**[Citation Graph (0, 0)][DBLP] TYPES, 2002, pp:1-20 [Conf] - Felix Joachimski, Ralph Matthes
**Short proofs of normalization for the simply- typed lambda-calculus, permutative conversions and Go"del's T.**[Citation Graph (0, 0)][DBLP] Arch. Math. Log., 2003, v:42, n:1, pp:59-87 [Journal] - Ralph Matthes
**Non-strictly positive fixed points for classical natural deduction.**[Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2005, v:133, n:1-3, pp:205-230 [Journal] - Ralph Matthes, Tarmo Uustalu
**Substitution in Non-wellfounded Syntax with Variable Binding.**[Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2003, v:82, n:1, pp:- [Journal] - Ralph Matthes
**Monotone (co)inductive types and positive fixed-point types.**[Citation Graph (0, 0)][DBLP] ITA, 1999, v:33, n:4/5, pp:309-328 [Journal] - Andreas Abel, Ralph Matthes, Tarmo Uustalu
**Iteration and coiteration schemes for higher-order and nested datatypes.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:333, n:1-2, pp:3-66 [Journal] - Ralph Matthes, Tarmo Uustalu
**Substitution in non-wellfounded syntax with variable binding.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:327, n:1-2, pp:155-174 [Journal] - José Espírito Santo, Ralph Matthes, Luis Pinto
**Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi.**[Citation Graph (0, 0)][DBLP] TLCA, 2007, pp:133-147 [Conf] **Recursion on Nested Datatypes in Dependent Type Theory.**[Citation Graph (, )][DBLP]**Nested Datatypes with Generalized Mendler Iteration: Map Fusion and the Example of the Representation of Untyped Lambda Calculus with Explicit Flattening.**[Citation Graph (, )][DBLP]**Verification of the Redecoration Algorithm for Triangular Matrices.**[Citation Graph (, )][DBLP]**Monadic Translation of Intuitionistic Sequent Calculus.**[Citation Graph (, )][DBLP]**Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |