Intersection types for λ-trees
Theoretical Computer Science - Special issue on theories of types and proofs
Innocent game models of untyped λ-calculus
Theoretical Computer Science - Special issue on theories of types and proofs
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Limiting Partial Combinatory Algebras towards Infinitary Lambda-Calculi and Classical Logic
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Infinitary lambda calculus and discrimination of Berarducci trees
Theoretical Computer Science - Australasian computer science
Non-Standard Semantics for Program Slicing
Higher-Order and Symbolic Computation
Adapting innocent game models for the Böhm tree λ-theory
Theoretical Computer Science
Confluence of the coinductive λ-calculus
Theoretical Computer Science
Limiting partial combinatory algebras
Theoretical Computer Science
Substitution in non-wellfounded syntax with variable binding
Theoretical Computer Science - Selected papers of CMCS'03
On modularity in infinitary term rewriting
Information and Computation
A rewriting calculus for cyclic higher-order term graphs
Mathematical Structures in Computer Science
On Normalisation of Infinitary Combinatory Reduction Systems
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Coinductive big-step operational semantics
Information and Computation
Applications of infinitary lambda calculus
Information and Computation
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Productivity of stream definitions
Theoretical Computer Science
A Rewriting Calculus for Cyclic Higher-order Term Graphs
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Edifices and full abstraction for the symmetric interaction combinators
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Correctness of copy in calculi with letrec
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Types for hereditary head normalizing terms
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Global and local space properties of stream programs
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
A contextual semantics for concurrent Haskell with futures
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Decomposing the lattice of meaningless sets in the infinitary lambda calculus
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
On confluence of infinitary combinatory reduction systems
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
The monadic second order theory of trees given by arbitrary level-two recursion schemes is decidable
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Continuity and discontinuity in lambda calculus
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Infinitary combinatory reduction systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Order structures on böhm-like models
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Infinitary rewriting: from syntax to semantics
Processes, Terms and Cycles
Standardization and böhm trees for Λµ-calculus
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
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
Computing in cantor's paradise with λZFC
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Pure type systems with corecursion on streams: from finite to infinitary normalisation
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Productivity of stream definitions
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Highlights in infinitary rewriting and lambda calculus
Theoretical Computer Science
The Cost of Usage in the ?-Calculus
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.01 |