A type system for well-founded recursion
From MaRDI portal
Publication:3452268
DOI10.1145/964001.964026zbMath1325.68046MaRDI QIDQ3452268
Publication date: 11 November 2015
Published in: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/964001.964026
68N18: Functional programming and lambda calculus
Related Items
Compilation of extended recursion in call-by-value functional languages, Path resolution for nested recursive modules, Type-specialized staged programming with process separation