Dimitri Hendriks
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Streams are forever | 2018-09-04 | Paper |
| Regularity preserving but not reflecting encodings 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| On periodically iterated morphisms Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
| Coinductive foundations of infinitary rewriting and infinitary equational logic | 2018-01-12 | Paper |
| A coinductive framework for infinitary rewriting and equational reasoning | 2017-07-12 | Paper |
| Universality of Univariate Mixed Fractions in Divisive Meadows | 2017-07-03 | Paper |
| Clocked lambda calculus Mathematical Structures in Computer Science | 2017-06-14 | Paper |
| Automatic sequences and zip-specifications 2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
| The degree of squares is an atom Lecture Notes in Computer Science | 2015-11-04 | Paper |
| On the complexity of stream equality Journal of Functional Programming | 2014-08-14 | Paper |
| On the complexity of equivalence of specifications of infinite objects Proceedings of the 17th ACM SIGPLAN international conference on Functional programming | 2014-07-21 | Paper |
| Discriminating lambda-terms using clocked Böhm trees Logical Methods in Computer Science | 2014-06-10 | Paper |
| Infinitary term rewriting for weakly orthogonal systems: properties and counterexamples Logical Methods in Computer Science | 2014-06-10 | Paper |
| Clocks for Functional Programs Lecture Notes in Computer Science | 2014-04-16 | Paper |
| Degrees of streams Integers | 2013-10-25 | Paper |
| Circular coinduction in Coq using bisimulation-up-to techniques Interactive Theorem Proving | 2013-08-07 | Paper |
| Mix-automatic sequences Language and Automata Theory and Applications | 2013-03-18 | Paper |
| Highlights in infinitary rewriting and lambda calculus Theoretical Computer Science | 2013-01-07 | Paper |
| Unique normal forms in infinitary weakly orthogonal rewriting | 2012-04-25 | Paper |
| Arithmetic Self-Similarity of Infinite Sequences | 2012-01-18 | Paper |
| Lazy productivity via termination Theoretical Computer Science | 2011-07-07 | Paper |
| Transforming Outermost into Context-Sensitive Rewriting Logical Methods in Computer Science | 2010-07-27 | Paper |
| \(\rightthreetimes\) Lecture Notes in Computer Science | 2010-04-20 | Paper |
| Productivity of stream definitions Theoretical Computer Science | 2010-02-09 | Paper |
| Complexity of Fractran and Productivity Automated Deduction – CADE-22 | 2009-07-28 | Paper |
| Proving Infinitary Normalization Lecture Notes in Computer Science | 2009-07-02 | Paper |
| From Outermost to Context-Sensitive Rewriting Rewriting Techniques and Applications | 2009-06-30 | Paper |
| Data-Oblivious Stream Productivity Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
| Productivity of Stream Definitions Fundamentals of Computation Theory | 2008-02-26 | Paper |
| On the mechanization of the proof of Hessenberg's theorem in coherent logic Journal of Automated Reasoning | 2008-02-18 | Paper |
| Automated proof construction in type theory using resolution Journal of Automated Reasoning | 2003-04-27 | Paper |
| Proof reflection in Coq Journal of Automated Reasoning | 2003-04-27 | Paper |
| scientific article; zbMATH DE number 1614692 (Why is no real title available?) | 2001-07-05 | Paper |
Research outcomes over time
This page was built for person: Dimitri Hendriks
