Subtyping arithmetical types

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2001, Pages 276-289

  Gil, J ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; FUNCTIONS; MATHEMATICAL OPERATORS; SET THEORY;

DIOPHANTINE EQUATIONS; HILBERTS TENTH PROBLEM; SUBTYPING;

DIGITAL ARITHMETIC;

EID: 0035031401     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/360204.360232     Document Type: Conference Paper

References (45)

1. Subtyping recursive types
2. The μtype system
3. Mockingbird: Flexible stub compilation from pairs of declarations
4. The mockingbird system: A compiler based approach to maximally interoperable distributed programming
5. Language processor construction: The case for YOOCC and TROOPER
6. Yes! An object-oriented compiler compiler YOOCC
7. On the combinatorial and algebraic complexity of quantifier elimination
8. Coinductive axiomatization of recursive type equality and subtyping
9. Quantifier elimination for real closed fields by cylindrical algebraic decomposition
10. Quantifier elimination by cylindrical algebraic decomposition-twenty years of progress
11. Subtyping with union types, intersection types and recursive types
12. Real quantifier elimination if doubly exponential
13. SOOP - A synthesizer of an object-oriented parser
14. The FISh programming definition
15. Universal diophantine equation
16. Efficient recursive subtyping
17. Enumerable sets are diophantine
18. On context-free languages
19. Documentation for general BIBTEX users
20. Using types as search keys in function libraries
21. Hilbert's tenth problem
22. A complete type inference system for subtyped recursive types
23. The programming language Pascal
24. Recommendation x.208: Speficiation of abstract syntax notation one (ASN.1)