On the algebraic models of Lambda calculus

Topological incompleteness and order incompleteness of the lambda calculus

ACM Transactions on Computational Logic (TOCL)

Nominal unification

Theoretical Computer Science

Graph models of $\lambda$-calculus at work, and variations

Mathematical Structures in Computer Science

Easiness in graph models

Theoretical Computer Science - Algebraic methods in language processing

Nonmodularity Results for Lambda Calculus

Fundamenta Informaticae

Nominal Equational Logic

Electronic Notes in Theoretical Computer Science (ENTCS)

a-Logic With Arrows

Electronic Notes in Theoretical Computer Science (ENTCS)

From λ-Calculus to Universal Algebra and Back

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science

A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets

Theoretical Computer Science

Universal algebra over lambda-terms and nominal terms: the connection in logic between nominal techniques and higher-order variables

Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice

A formal calculus for informal equality with binding

WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation

Resource combinatory algebras

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science

Capture-avoiding substitution as a nominal algebra

ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing

Scott is always simple

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science

Nonmodularity Results for Lambda Calculus

Fundamenta Informaticae