An Idealized MetaML: Simpler, and More Expressive
Abstract elided by the publisher.
Related papers
- Incremental type-checking for type-reflective metaprograms GPCE 2010
- Binding-Time Analysis for MetaML via Type Inference and Constraint Solving TACAS 2004
- Closed types for a safe imperative MetaML JFP 2003
- Geometry of synthesis III: resource management through type inference POPL 2011
- Oaklisp: an Object-Oriented Scheme with First Class Types OOPSLA 1986
- Untyped Strictness Analysis JFP 1995
- Verifying Term Graph Optimizations using Isabelle/HOL CPP 2023
- SecCSL: Security Concurrent Separation Logic CAV 2019