Armando B. Matos

17 papers C 2Misc 2Journal 11Unranked 1
YearRankTypeTitle / Venue / Authors
2021 J jnl
Interleaving classical and reversible.
CoRR
Armando B. Matos, Luca Paolini, Luca Roversi
2021 C conf
Splitting Recursion Schemes into Reversible and Classical Interacting Threads.
RC
Armando B. Matos, Luca Paolini, Luca Roversi
2021 J jnl
Splitting recursion schemes into reversible and classical interacting threads.
CoRR
Armando B. Matos, Luca Paolini, Luca Roversi
2020 C conf
On the Expressivity of Total Reversible Programming Languages.
RC
Armando B. Matos, Luca Paolini, Luca Roversi
2020 J jnl
The fixed point problem of a simple reversible language.
Theor. Comput. Sci.
Armando B. Matos, Luca Paolini, Luca Roversi
2018 — conf
The Fixed Point Problem for General and for Linear SRL Programs is Undecidable.
ICTCS
Armando B. Matos, Luca Paolini, Luca Roversi
2016 J jnl
Primitive recursive functions versus partial recursive functions: comparing the degree of undecidability.
CoRR
Armando B. Matos
2015 J jnl
The efficiency of primitive recursive functions: A programmer's view.
Theor. Comput. Sci.
Armando B. Matos
2003 J jnl
Linear programs in a simple reversible language.
Theor. Comput. Sci.
Armando B. Matos
1997 J jnl
Monadic Logic Programs and Functional Complexity.
Theor. Comput. Sci.
Armando B. Matos
1994 J jnl
A Matrix Model for the Flow of Control in Prolog Programs with Applications to Profiling.
Softw. Pract. Exp.
Armando B. Matos
1994 J jnl
An introduction to ultimately periodic sets of integers.
SIGACT News
Armando B. Matos
1994 J jnl
Periodic Sets of Integers.
Theor. Comput. Sci.
Armando B. Matos
1993 Misc conf
Regular Languages and a Class of Logic Programs.
EPIA
Armando B. Matos
1993 Misc conf
Some Results on the Complexity of SLD-Derivations.
EPIA
Armando B. Matos
1980 J jnl
Ackermann and the superpowers.
SIGACT News
António Porto, Armando B. Matos
1980 — —
Simulação computacional de redes de caminhos de ferro electrificadas
Armando B. Matos