A sound strategy to compile general recursion into finite depth pattern matching

DOI10.1007/978-3-031-22476-8_3zbMath1528.68050OpenAlexW4312404393MaRDI QIDQ6113899

Rodrigo G. Ribeiro, Maycon J. J. Amaro, Samuel S. Feitosa

Publication date: 10 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-22476-8_3

zbMATH Keywords

recursionprogram transformationprogram generation

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A predicative analysis of structural recursion
• Turing-Completeness Totally Free
• Type-Based Termination with Sized Products
• Type-based termination of recursive definitions
• A Tutorial on Type-Based Termination

This page was built for publication: A sound strategy to compile general recursion into finite depth pattern matching