Pages that link to "Item:Q918190"
From MaRDI portal
The following pages link to Type inference for polymorphic references (Q918190):
Displaying 31 items.
- Basic polymorphic typechecking (Q580956) (← links)
- A type soundness proof for variables in LCF ML (Q672255) (← links)
- Polymorphic type inference and containment (Q1110312) (← links)
- Co-induction in relational semantics (Q1177158) (← links)
- A simplified account of polymorphic references (Q1334643) (← links)
- Sharing analysis based on type inference (Q1346608) (← links)
- A note on ``A simplified account of polymorphic references'' (Q1350743) (← links)
- A linear logical framework (Q1400718) (← links)
- Corrigendum: Polymorphic type assignment and CPS conversion (Q1426870) (← links)
- A cost-effective estimation of uncaught exceptions in Standard ML programs (Q1605229) (← links)
- Type soundness for path polymorphism (Q1744425) (← links)
- Weak updates and separation logic (Q1758657) (← links)
- Explaining type inference (Q1919354) (← links)
- Mechanized metatheory revisited (Q2323447) (← links)
- Types for modules (Q2375744) (← links)
- A Classical Realizability Model for a Semantical Value Restriction (Q2802494) (← links)
- Explaining Polymorphic Types (Q3148232) (← links)
- (Q4222932) (← links)
- Trace semantics for polymorphic references (Q4635919) (← links)
- Weak polymorphism can be sound (Q4880527) (← links)
- <scp>OutsideIn(X)</scp>Modular type inference with local assumptions (Q4918240) (← links)
- A record calculus with principal types (Q5096310) (← links)
- An imperative object calculus (Q5096750) (← links)
- No value restriction is needed for algebraic effects and handlers (Q5372003) (← links)
- Operational interpretations of an extension of F<sub>ω</sub> with control operators (Q5687907) (← links)
- Simple type inference for term graph rewriting systems (Q5881175) (← links)
- Programming Languages and Systems (Q5899023) (← links)
- From semantics to types: the case of the imperative \(\lambda\)-calculus (Q6093581) (← links)
- A type system for effect handlers and dynamic labels (Q6535238) (← links)
- Formal verification of algorithm \(\mathcal{W}\): the monomorphic case (Q6567723) (← links)
- Signature restriction for polymorphic algebraic effects (Q6594243) (← links)
