Intersection types for λ-trees
Theoretical Computer Science - Special issue on theories of types and proofs
Infinitary lambda calculus and discrimination of Berarducci trees
Theoretical Computer Science - Australasian computer science
Adapting innocent game models for the Böhm tree λ-theory
Theoretical Computer Science
Limiting partial combinatory algebras
Theoretical Computer Science
On modularity in infinitary term rewriting
Information and Computation
Calculi, types and applications
Theoretical Computer Science
Coinductive big-step operational semantics
Information and Computation
On modularity in infinitary term rewriting
Information and Computation
Deciding monadic theories of hyperalgebraic trees
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Types for hereditary head normalizing terms
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Order structures on böhm-like models
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Standardization and böhm trees for Λµ-calculus
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Untyped recursion schemes and infinite intersection types
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
A hierarchy for delimited continuations in call-by-name
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Coinductive big-step operational semantics
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Böhm theorem and Böhm trees for the Λμ-calculus
Theoretical Computer Science
| Hi-index | 0.02 |