On Uniquely Closable and Uniquely Typable Skeletons of Lambda Terms-Reference-Cited by-同舟云学术

On Uniquely Closable and Uniquely Typable Skeletons of Lambda Terms

Published:2018 Issue: Volume: Page:252-268
ISSN:0302-9743
Container-title:Logic-Based Program Synthesis and Transformation
language:
Short-container-title:

Author:

Bodini Olivier,Tarau Paul

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-94460-9_15

Reference18 articles.

1. Barendregt, H.P.: The Lambda Calculus Its Syntax and Semantics. Revised edn. vol. 103. North Holland (1984)

2. de Bruijn, N.G.: Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indagationes Mathematicae 34, 381–392 (1972)

3. Howard, W.: The formulae-as-types notion of construction. In: Seldin, J., Hindley, J. (eds.) To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 479–490. Academic Press, London (1980)

4. Barendregt, H.P.: Lambda calculi with types. In: Handbook of Logic in Computer Science, vol. 2. Oxford University Press, Oxford (1991)

5. Palka, M.H., Claessen, K., Russo, A., Hughes, J.: Testing an optimising compiler by generating random lambda terms. In: Proceedings of the 6th International Workshop on Automation of Software Test, AST 2011, New York, NY, USA, pp. 91–97. ACM (2011)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms;Fundamenta Informaticae;2020-12-10

2. Deriving Theorems in Implicational Linear Logic, Declaratively;Electronic Proceedings in Theoretical Computer Science;2020-09-19

3. On k-colored Lambda Terms and Their Skeletons;Practical Aspects of Declarative Languages;2017-12-22