Giorgio Germano

Proceedings of the Workshop of the COMETA Project on Computational Metamodels, 2003

1991

Closure Functions and General Iterates as Reflectors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

General Iteration and Unary Functions.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1991

1987

Loose Diagrams, Semigroupoids, Categories, Groupoids and Iteration.

[BibT_eX]

[DOI]

Proceedings of the CSL '87, 1987

A Setting for Generalized Computability.

[BibT_eX]

[DOI]

Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

1981

Sequence Recursiveness Without Cylindrification and Limited Register Machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1981

1979

Computable Stack Functions for Semantics of Stack Programs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1979

1976

An arithmetical reconstruction of the liar's antinomy using addition and multiplication.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1976

A language for Markov's algorithms composition.

[BibT_eX]

[DOI]

Acta Cybern., 1976

Recursivity, Sequence Recursivity, Stack Recursivity and Semantics of Programs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1975

Proving a Compiler Correct: A Simple Approach.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1975

Sequence-to-Sequence Recursiveness.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1975

1974

Loops in Algol 60 and in category theory.

[BibT_eX]

[DOI]

SIGACT News, 1974

1973

Incompleteness theorem via weak definability of truth: a short proof.

[BibT_eX]

[DOI]