Extending the loop language with higher-order procedural variables
From MaRDI portal
Publication:2946583
DOI10.1145/1555746.1555750zbMATH Open1351.68048OpenAlexW2138934928MaRDI QIDQ2946583FDOQ2946583
Authors: T. Crolard, E. Polonowski, Pierre Valarcher
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1555746.1555750
Recommendations
- On the expressive power of the loop language
- The expressiveness of looping terms in the semantic programming
- Publication:4506388
- scientific article; zbMATH DE number 4104365
- Loops in combinator-based compilers
- scientific article; zbMATH DE number 1862079
- Adding multidimensionality to procedural programming languages
- scientific article; zbMATH DE number 3999256
- scientific article; zbMATH DE number 1173731
- Using circular programs for higher-order syntax (functional pearl)
Theory of programming languages (68N15) Logic in computer science (03B70) Functional programming and lambda calculus (68N18)
Cited In (4)
This page was built for publication: Extending the loop language with higher-order procedural variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946583)