Conditions for the completeness of functional and algebraic equational reasoningA preliminary version titled ‘Algebraic Reasoning and Completeness in Typed Languages’ appeared in Twentieth ACM Conference on Principles of Programming Languages, pages 185–195, ACM Press, 1993
págs. 651-685
Observational trees as models for concurrency
ANNA LABELLA, STEFANO KASANGIAN
págs. 687-718
A general method for proving the normalization theorem for first and second order typed λ-calculi
SILVIO VALENTINI, VENANZIO CAPRETTA
págs. 719-739
© 2008-2024 Fundación Dialnet · Todos los derechos reservados
Coordinado por: