Path resolution for nested recursive modules

DOI10.1007/S10990-012-9083-6zbMath1256.68032OpenAlexW2031262568MaRDI QIDQ1929336

Keiko Nakata, Jacques Garrigue

Publication date: 8 January 2013

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10990-012-9083-6

zbMATH Keywords

decidabilityterminationrecursive modulesground term rewritingthe ML module system

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Path resolution for nested recursive modules

Uses Software

• ML
• OCaml
• MixML

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• Path resolution for nested recursive modules
• Recursive type generativity
• A type system for higher-order modules
• A syntactic theory of type generativity and sharing
• A type system for well-founded recursion
• A modular module system
• The recursive record semantics of objects revisited
• A type system for recursive modules
• Recursive structures for standard ML
• Mixin' up the ML module system
• Modeling abstract types in modules with open existential types
• Recursive modules for programming
• A Core Calculus for Scala Type Checking

This page was built for publication: Path resolution for nested recursive modules