 | 2004 |
|---|
| 11 |       | Giorgio Germano,
Stefano Mazzanti:
Peano Structures and the Semantics of Iteration.
Electr. Notes Theor. Comput. Sci. 104: 149-162 (2004) |
| 1991 |
|---|
| 10 | | Giorgio Germano,
Stefano Mazzanti:
General Iteration and Unary Functions.
Ann. Pure Appl. Logic 54(2): 137-178 (1991) |
| 9 | | Giorgio Germano,
Stefano Mazzanti:
Closure Functions and General Iterates as Reflectors.
Theor. Comput. Sci. 82(2): 215-252 (1991) |
| 1987 |
|---|
| 8 | | Giorgio Germano,
Stefano Mazzanti:
Loose Diagrams, Semigroupoids, Categories, Groupoids and Iteration.
CSL 1987: 64-80 |
| 7 | | Giorgio Germano,
Stefano Mazzanti:
A Setting for Generalized Computability.
Computation Theory and Logic 1987: 154-165 |
| 1981 |
|---|
| 6 | | Giorgio Germano,
Andrea Maggiolo-Schettini:
Sequence Recursiveness Without Cylindrification and Limited Register Machines.
Theor. Comput. Sci. 15: 213-221 (1981) |
| 1979 |
|---|
| 5 | | Giorgio Germano,
Andrea Maggiolo-Schettini:
Computable Stack Functions for Semantics of Stack Programs.
J. Comput. Syst. Sci. 19(2): 133-144 (1979) |
| 1977 |
|---|
| 4 |  | Giorgio Germano,
Andrea Maggiolo-Schettini:
A language for Markov's algorithms composition.
Acta Cybern. 3: 31-35 (1977) |
| 1976 |
|---|
| 3 | | Giorgio Germano,
Andrea Maggiolo-Schettini:
Recursivity, Sequence Recursivity, Stack Recursivity and Semantics of Programs.
MFCS 1976: 52-64 |
| 1975 |
|---|
| 2 | | Giorgio Germano,
Andrea Maggiolo-Schettini:
Sequence-to-Sequence Recursiveness.
Inf. Process. Lett. 4(1): 1-6 (1975) |
| 1 | | Giorgio Germano,
Andrea Maggiolo-Schettini:
Proving a Compiler Correct: A Simple Approach.
J. Comput. Syst. Sci. 10(3): 370-383 (1975) |
Data released under the ODC-BY 1.0 license — See also our legal information page