Armando B. Matos

CoRR, 2021

Splitting Recursion Schemes into Reversible and Classical Interacting Threads.

[BibT_eX]

[DOI]

Proceedings of the Reversible Computation - 13th International Conference, 2021

2020

The fixed point problem of a simple reversible language.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

On the Expressivity of Total Reversible Programming Languages.

[BibT_eX]

[DOI]

Proceedings of the Reversible Computation - 12th International Conference, 2020

2018

The Fixed Point Problem for General and for Linear SRL Programs is Undecidable.

[BibT_eX]

[DOI]

Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

2016

Primitive recursive functions versus partial recursive functions: comparing the degree of undecidability.

[BibT_eX]

[DOI]

CoRR, 2016

2015

The efficiency of primitive recursive functions: A programmer's view.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

2003

Linear programs in a simple reversible language.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

1997

Monadic Logic Programs and Functional Complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

1994

Periodic Sets of Integers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

A Matrix Model for the Flow of Control in Prolog Programs with Applications to Profiling.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 1994

An introduction to ultimately periodic sets of integers.

[BibT_eX]

[DOI]

SIGACT News, 1994

1993

Some Results on the Complexity of SLD-Derivations.

[BibT_eX]

[DOI]

Proceedings of the Progress in Artificial Intelligence, 1993

Regular Languages and a Class of Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the Progress in Artificial Intelligence, 1993

1980

Simulação computacional de redes de caminhos de ferro electrificadas

[BibT_eX]

[DOI]

PhD thesis, 1980

Ackermann and the superpowers.

[BibT_eX]

[DOI]

António Porto