Irène Durand

Proceedings of the 15th European Lisp Symposium, 2022

2020

A unified algorithm for colouring graphs of bounded clique-width.

[BibT_eX]

[DOI]

Michael Raskin

CoRR, 2020

Bidirectional leveled enumerators.

[BibT_eX]

[DOI]

Proceedings of the 13th European Lisp Symposium (ELS 2020), 2020

2019

Bootstrapping Common Lisp Using Common Lisp.

[BibT_eX]

[DOI]

Proceedings of the 12th European Lisp Symposium (ELS 2019), 2019

MAKE-METHOD-LAMBDA Revisited.

[BibT_eX]

[DOI]

Proceedings of the 12th European Lisp Symposium (ELS 2019), 2019

2018

Partial Inlining Using Local Graph Rewriting.

[BibT_eX]

Proceedings of the 11th European Lisp Symposium (ELS 2018), 2018

Incremental Parsing of Common Lisp Code.

[BibT_eX]

[DOI]

Proceedings of the 11th European Lisp Symposium (ELS 2018), 2018

2017

Removing Redundant Tests by Replicating Control Paths.

[BibT_eX]

[DOI]

Proceedings of the 10th European Lisp Symposium (ELS 2017), 2017

Fast, Maintainable, and Portable Sequence Functions.

[BibT_eX]

[DOI]

Proceedings of the 10th European Lisp Symposium (ELS 2017), 2017

2016

Model Checking with Fly-Automata.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Computations by fly-automata beyond monadic second-order logic.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

2015

Bottom-up rewriting for words and terms.

[BibT_eX]

[DOI]

Géraud Sénizergues

J. Symb. Comput., 2015

Processing Lisp Elements in Reverse Order.

[BibT_eX]

[DOI]

Proceedings of the 8th European Lisp Symposium (ELS 2015), 2015

2014

Fly-automata, model-checking and recognizability.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Infinite Transducers on Terms Denoting Graphs.

[BibT_eX]

[DOI]

Proceedings of ELS 2013 - 6th European Lisp Symposium, Madrid, Spain, June 3-4, 2013., 2013

Model-Checking by Infinite Fly-Automata.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics - 5th International Conference, 2013

2012

Automata for the verification of monadic second-order graph properties.

[BibT_eX]

[DOI]

J. Appl. Log., 2012

Object Enumeration.

[BibT_eX]

[DOI]

Proceedings of ELS 2012 - 5th European Lisp Symposium, Zadar, Croatia, April 30, 2012

2011

Fly-Automata, Their Properties and Applications.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2011

Left-linear Bounded TRSs are Inverse Recognizability Preserving.

[BibT_eX]

[DOI]

Marc Sylvestre

Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

Implementing Huge Term Automata.

[BibT_eX]

[DOI]

Proceedings of ELS 2011 - 4th European Lisp Symposium, Hamburg, Germany, March 31, 2011

2010

Termination of linear bounded term rewriting systems.

[BibT_eX]

[DOI]

Géraud Sénizergues

Marc Sylvestre

Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

Verifying Monadic Second Order Graph Properties with Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the 3rd European Lisp Symposium (ELS 2010), 2010

2009

On the Complexity of Deciding Call-by-Need

[BibT_eX]

[DOI]

CoRR, 2009

2008

A Tool for Reasoning about Qualitative Temporal Information: the Theory of S-languages with a Lisp Implementation.

[BibT_eX]

[DOI]

Sylviane R. Schwer

J. Univers. Comput. Sci., 2008

Reasoning about qualitative temporal information with S-words and S-languages.

[BibT_eX]

[DOI]

Sylviane R. Schwer

Proceedings of the 1st European Lisp Symposium (ELS'08), 2008

2007

Bottom-Up Rewriting Is Inverse Recognizability Preserving.

[BibT_eX]

[DOI]

Géraud Sénizergues

Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

2005

Decidable call-by-need computations in term rewriting.

[BibT_eX]

[DOI]

Inf. Comput., 2005

Call by need computations in orthogonal term rewriting systems.

[BibT_eX]

[DOI]

, 2005

2004

A Tool for Term Rewrite Systems and Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the 4th International Workshop on Reduction Strategies in Rewriting and Programming, 2004

2002

Autowrite: A Tool for Checking Properties of Term Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

2001

On the Modularity of Deciding Call-by-Need.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2001

1997

Decidable Call by Need Computations in term Rewriting (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction, 1997

1994

Bounded, Strongly Sequential and Forward-Branching Term Rewriting Systems.

[BibT_eX]

[DOI]

J. Symb. Comput., 1994

Constructor Equivalent Term Rewriting Systems are Strongly Sequential: A Direct Proof.

[BibT_eX]

[DOI]

Bruno Salinier

Inf. Process. Lett., 1994

1993

Constructor Equivalent Term Rewriting Systems.

[BibT_eX]

[DOI]

Bruno Salinier

Inf. Process. Lett., 1993

1991

Partial Evaluation of an Intermediate Language for Equational Programs.

[BibT_eX]

David J. Sherman

Proceedings of the Actes JTASPEFL'91 (Bordeaux, 1991

Optimization of Equational Programs Using Partial Evaluation.

[BibT_eX]

[DOI]

David J. Sherman

Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1991

1987

Simulation Results of a Multiprocessor Prolog Architecture Based on a Distributed and/or Graph.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

1986

Résolution parallèle de sous-buts indépendants dans le graphe de connexion de R. Kowalski.

[BibT_eX]

Proceedings of the SPLT'86, 1986

1985

COALA: un réseau d'acteurs pour une architecture multiprocesseur Prolog.

[BibT_eX]

Christian Percebois