Armando B. Matos

dblp:87/5391 · DBLP profile ↗
← Back
8ranked-venue papers
8as first author
1since 2021 · last 2021
0000-0003-2144-4439ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 7 · 7 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author
YearPublicationVenuePosition
2021 Splitting Recursion Schemes into Reversible and Classical Interacting Threads
Armando B. Matos, Luca Paolini, Luca Roversi
RC1
2020 On the Expressivity of Total Reversible Programming Languages
Armando B. Matos, Luca Paolini, Luca Roversi
RC1
2020 The fixed point problem of a simple reversible language
Armando B. Matos, Luca Paolini, Luca Roversi
Theor. Comput. Sci.1
2015 The efficiency of primitive recursive functions: A programmer's view
Armando B. Matos
Theor. Comput. Sci.1
2003 Linear programs in a simple reversible language
Armando B. Matos
Theor. Comput. Sci.1
1997 Monadic Logic Programs and Functional Complexity
Armando B. Matos
Theor. Comput. Sci.1
1994 A Matrix Model for the Flow of Control in Prolog Programs with Applications to Profiling
abstract
Abstract In Prolog the flow of control is relatively complex; four counts (which we call currents)—call, fail, succeed and redo—and two intrinsic properties—the failure and the ‘alternative’ probabilities—can be associated with every literal in a clause body. In this work we describe a new matrix model where those currents and properties are related at the literal, clause and predicate definition levels. This model is useful for predicate classification, execution profiling and program debugging. The application to profilers is discussed in detail.
Armando B. Matos
Softw. Pract. Exp.1
1994 Periodic Sets of Integers
Armando B. Matos
Theor. Comput. Sci.1