Dimitri Hendriks

According to our database1, Dimitri Hendriks authored at least 40 papers between 2002 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Applying transfer function-noise modelling to characterize soil moisture dynamics: a data-driven approach using remote sensing data.
Environ. Model. Softw., 2020

2018
Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic.
Log. Methods Comput. Sci., 2018

2017
Clocked lambda calculus.
Math. Struct. Comput. Sci., 2017

Universality of Univariate Mixed Fractions in Divisive Meadows.
CoRR, 2017

2015
A Coinductive Framework for Infinitary Rewriting and Equational Reasoning (Extended Version).
CoRR, 2015

The Degree of Squares is an Atom (Extended Version).
CoRR, 2015

A Coinductive Framework for Infinitary Rewriting and Equational Reasoning.
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

Regularity Preserving but Not Reflecting Encodings.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

The Degree of Squares is an Atom.
Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2014
On the complexity of stream equality.
J. Funct. Program., 2014

Discriminating Lambda-Terms Using Clocked Boehm Trees
Log. Methods Comput. Sci., 2014

An Introduction to the Clocked Lambda Calculus.
CoRR, 2014

Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples.
Log. Methods Comput. Sci., 2014

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), 2014

2013
Streams are Forever.
Bull. EATCS, 2013

A Coinductive Treatment of Infinitary Rewriting.
CoRR, 2013

Mix-Automatic Sequences.
Proceedings of the Language and Automata Theory and Applications, 2013

Circular Coinduction in Coq Using Bisimulation-Up-To Techniques.
Proceedings of the Interactive Theorem Proving - 4th International Conference, 2013

Clocks for Functional Programs.
Proceedings of the Beauty of Functional Code, 2013

2012
Highlights in infinitary rewriting and lambda calculus.
Theor. Comput. Sci., 2012

Arithmetic Self-Similarity of Infinite Sequences.
CoRR, 2012

Automatic Sequences and Zip-Specifications.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

On the complexity of equivalence of specifications of infinite objects.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2012

2011
Lazy productivity via termination.
Theor. Comput. Sci., 2011

Degrees of Streams.
Integers, 2011

2010
Productivity of stream definitions.
Theor. Comput. Sci., 2010

Transforming Outermost into Context-Sensitive Rewriting
Log. Methods Comput. Sci., 2010

Modular Construction of Fixed Point Combinators and Clocked Boehm Trees
CoRR, 2010

Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting.
Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

Modular Construction of Fixed Point Combinators and Clocked Bohm Trees.
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

2009
Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting
CoRR, 2009

Let's Make a Difference!
CoRR, 2009

From Outermost to Context-Sensitive Rewriting.
Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

Complexity of Fractran and Productivity.
Proceedings of the Automated Deduction, 2009

2008
On the Mechanization of the Proof of Hessenberg's Theorem in Coherent Logic.
J. Autom. Reason., 2008

Proving Infinitary Normalization.
Proceedings of the Types for Proofs and Programs, International Conference, 2008

Data-Oblivious Stream Productivity.
Proceedings of the Logic for Programming, 2008

2003
adbmal
Proceedings of the Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28, 2003

2002
Proof Reflection in Coq.
J. Autom. Reason., 2002

Automated Proof Construction in Type Theory Using Resolution.
J. Autom. Reason., 2002


  Loading...