Tail recursion modulo context: an equational approach (extended version)
From MaRDI portal
Cites work
- A logical approach to type soundness
- A relational model of types-and-effects in higher-order concurrent separation logic
- A static simulation of dynamic delimited control
- A syntactic approach to type soundness
- A very modal model of a modern, major, general type system
- Algebraic operations and generic effects
- An efficient machine-independent procedure for garbage collection in various list structures
- Compiling lambda-expressions using continuations and factorizations
- Continuation-Based Program Transformation Strategies
- From ML to Ada: Strongly-typed language interoperability via source translation
- Handlers of Algebraic Effects
- scientific article; zbMATH DE number 3982493 (Why is no real title available?)
- scientific article; zbMATH DE number 3566137 (Why is no real title available?)
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- Koka: programming with row polymorphic effect types
- Polymorphic typed defunctionalization
- Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
- Programming languages and system architectures. International conference, Zurich, Switzerland, March 2-4, 1994. Proceedings
- Purely Functional Data Structures
- Recycling continuations
- Revised report on the algorithmic language scheme
- The promotion and accumulation strategies in transformational programming
- The Zipper
- Type directed compilation of row-typed algebraic effects
- Type-driven defunctionalization
- Unifying refinement and Hoare-style reasoning in a logic for higher-order concurrency
This page was built for publication: Tail recursion modulo context: an equational approach (extended version)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6895006)
