Types for modules

zbMath1266.68086MaRDI QIDQ2375744

Claudio V. Russo

Publication date: 14 June 2013

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

Full work available at URL: http://www.sciencedirect.com/science/journal/15710661/60

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (3)

The existential fragment of second-order propositional intuitionistic logic is undecidable ⋮ 1ML – Core and modules united ⋮ Lightweight Static Capabilities

Uses Software

• ML
• Modula

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatory logic. With two sections by William Craig.
• Type inference for polymorphic references
• Pebble, a kernel language for modules and abstract data types
• Unification under a mixed prefix
• A unification algorithm for typed \(\bar\lambda\)-calculus
• A theory of type polymorphism in programming
• The definition of Extended ML: A gentle introduction
• Corrigendum: Polymorphic type assignment and CPS conversion
• Static interpretation of modules
• A type system for higher-order modules
• A syntactic theory of type generativity and sharing
• A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
• A modular module system
• A semantic basis for Quest
• Recursive structures for standard ML
• A Machine-Oriented Logic Based on the Resolution Principle

This page was built for publication: Types for modules