The following pages link to Didier Rémy (Q428890):
Displayed 26 items.
- A Church-style intermediate language for ML\(^{\text F}\) (Q428892) (← links)
- Recasting ML\(^{\text F}\) (Q1023287) (← links)
- Inheritance in the join calculus. (Q1426056) (← links)
- Semi-explicit first-class polymorphism for ML. (Q1854319) (← links)
- Full Reduction in the Face of Absurdity (Q2802461) (← links)
- Simple, partial type-inference for System F based on type-containment (Q2936776) (← links)
- Ambivalent Types for Principal Type Inference with GADTs (Q2937793) (← links)
- On the power of coercion abstraction (Q2942887) (← links)
- Which simple types have a unique inhabitant? (Q2981966) (← links)
- A Church-Style Intermediate Language for ML F (Q3558327) (← links)
- (Q4249168) (← links)
- (Q4364382) (← links)
- (Q4472462) (← links)
- (Q4490734) (← links)
- System F with coercion constraints (Q4635618) (← links)
- (Q4813229) (← links)
- Dynamic typing in polymorphic languages (Q4836024) (← links)
- (Q4855342) (← links)
- (Q4937118) (← links)
- From ML to ML <sup>F</sup> (Q5178756) (← links)
- ML <sup>F</sup> (Q5261264) (← links)
- Modeling abstract types in modules with open existential types (Q5261533) (← links)
- GADTs Meet Subtyping (Q5326307) (← links)
- Typed Lambda Calculi and Applications (Q5704008) (← links)
- Implicit typing à la ML for the join-calculus (Q6044118) (← links)
- A calculus of mobile agents (Q6104384) (← links)