Finite Combinatory Logic with Intersection Types-Reference-Cited by-同舟云学术

Finite Combinatory Logic with Intersection Types

Published:2011 Issue: Volume: Page:169-183
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Rehof Jakob,Urzyczyn Paweł

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-21691-6_15

Reference22 articles.

1. Barendregt, H., Coppo, M., Dezani-Ciancaglini, M.: A filter lambda model and the completeness of type assignment. Journal of Symbolic Logic 48(4), 931–940 (1983)

2. Ben-Yelles, C.: Type Assignment in the Lambda-Calculus: Syntax and Semantics. PhD thesis, Department of Pure Mathematics, University College of Swansea (September 1979)

3. Coppo, M., Dezani-Ciancaglini, M.: An extension of basic functionality theory for lambda-calculus. Notre Dame Journal of Formal Logic 21, 685–693 (1980)

4. Dezani-Ciancaglini, M., Hindley, J.R.: Intersection types for combinatory logic. Theoretical Computer Science 100(2), 303–324 (1992)

5. Comon, H., et al.: Tree Automata Techniques and Applications (2008), http://tata.gforge.inria.fr

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

1. Higher-Order MSL Horn Constraints;Proceedings of the ACM on Programming Languages;2023-01-09

2. Design Space Exploration for Sampling-Based Motion Planning Programs with Combinatory Logic Synthesis;Algorithmic Foundations of Robotics XV;2022-12-15

3. Automatic Component-Based Synthesis of User-Configured Manufacturing Simulation Models;2022 Winter Simulation Conference (WSC);2022-12-11

4. Semantics for Combinatory Logic With Intersection Types;Frontiers in Computer Science;2022-07-12

5. Taming the Merge Operator;Journal of Functional Programming;2021