Foreword
Thomas Ehrhard, Yves Lafont, Laurent Regnier
pág. 541
Minimality of the correctness criterion for multiplicative proof nets
págs. 543-558
Abstract Böhm trees
págs. 559-591
Type assignment and termination of interaction nets
págs. 593-636
An environment machine for the λμ-calculus
págs. 637-669
Regular Böhm trees
págs. 671-680
Concurrent programming as proof net construction
págs. 681-710
© 2001-2024 Fundación Dialnet · Todos los derechos reservados
Coordinado por: