On the Jacopini technique
From MaRDI portal
Publication:1376416
DOI10.1006/INCO.1997.2655zbMATH Open0887.68010OpenAlexW2073877447MaRDI QIDQ1376416FDOQ1376416
Publication date: 25 May 1998
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://research.utwente.nl/en/publications/on-the-jacopini-technique(af345c26-6e9d-4415-8ac7-c372bef22177).html
Recommendations
Cites Work
- LCF considered as a programming language
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Some new results on easy lambda-terms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving functional equations at higher types; some examples and some theorems
Cited In (7)
- 1998 European Summer Meeting of the Association for Symbolic Logic
- Title not available (Why is that?)
- Similarities, differences, and preservation of efficiencies, with application to attitude analysis, within the graph model for conflict resolution
- Simple easy terms
- Easy lambda-terms are not always simple
- Intersection types and domain operators
- Marginalia to a theorem of Jacopini
This page was built for publication: On the Jacopini technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1376416)