Armando B. Matos - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 14 from 14

2021

Splitting Recursion Schemes into Reversible and Classical Interacting ThreadsArmando B. Matos, Luca Paolini, Luca Roversi. RC 2021: 204-213 [doi]

2020

The fixed point problem of a simple reversible languageArmando B. Matos, Luca Paolini, Luca Roversi. TCS, 813:143-154, 2020. [doi]

On the Expressivity of Total Reversible Programming LanguagesArmando B. Matos, Luca Paolini, Luca Roversi. RC 2020: 128-143 [doi]

2018

The Fixed Point Problem for General and for Linear SRL Programs is UndecidableArmando B. Matos, Luca Paolini, Luca Roversi. ictcs 2018: 128-139 [doi]

2015

The efficiency of primitive recursive functions: A programmer's viewArmando B. Matos. TCS, 594:65-81, 2015. [doi]

2003

Linear programs in a simple reversible languageArmando B. Matos. TCS, 290(3):2063-2074, 2003.

1997

Monadic Logic Programs and Functional ComplexityArmando B. Matos. TCS, 176(1-2):175-204, 1997. [doi]

1994

Periodic Sets of IntegersArmando B. Matos. TCS, 127(2):287-312, 1994.

A Matrix Model for the Flow of Control in Prolog Programs with Applications to ProfilingArmando B. Matos. SPE, 24(8):729-746, 1994.

An introduction to ultimately periodic sets of integersArmando B. Matos. sigact, 25(1):90-96, 1994. [doi]

1993

Regular Languages and a Class of Logic ProgramsArmando B. Matos. epia 1993: 150-157

Some Results on the Complexity of SLD-DerivationsArmando B. Matos. epia 1993: 158-169

1980

Simulação computacional de redes de caminhos de ferro electrificadasArmando B. Matos. PhD thesis, University of Porto, Portugal, 1980. [doi]

Ackermann and the superpowersAntónio Porto, Armando B. Matos. sigact, 12(3):90-95, 1980. [doi]

Sign in or sign up to see more results.

runs on WebDSL