EasyChair Smart SlideUser guide
Conference: PARIS-18 (Workshop on Programming And Reasoning on Infinite Structures)

This page shows all presentations from this conference published in EasyChair Smart Slide.

The size-change principle and circular proofs: checking totality of (co)recursive definitions

The size-change principle and circular proofs: checking totality of (co)recursive definitions

Pierre Hyvernat

Collapses of Fixpoint Alternation Hierarchies in Low Type-Levels of Higher-Order Fixpoint Logic

Collapses of Fixpoint Alternation Hierarchies in Low Type-Levels of Higher-Order Fixpoint Logic

Florian Bruse, Martin Lange and Etienne Lozes

Transitive Closure Logic: Infinitary and Cyclic Proof Systems

Transitive Closure Logic: Infinitary and Cyclic Proof Systems

Reuben Rowe and Liron Cohen

Towards the Automatic Construction of Schematic Proofs

Towards the Automatic Construction of Schematic Proofs

David Cerna and Michael Lettmann

What makes guarded types tick?

What makes guarded types tick?

Patrick Bahr, Bassel Mannaa and Rasmus Ejlers Møgelberg

Presentations in this collection: 5
Copyright © 2002 – 2026 EasyChair