A semantics for λstr{}: A calculus with overloading and late-binding

Journal of Logic and Computation

Volumn 11, Issue 4, 2001, Pages 527-544

  Studer, T ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

Explicit mathematics; Late binding; Loss of information; Overloading; Typed calculus

Indexed keywords

COMPUTATION THEORY; DIFFERENTIATION (CALCULUS); OBJECT ORIENTED PROGRAMMING; PROBLEM SOLVING;

EXPLICIT MATHEMATICS; LATE-BINDING; OVERLOADING;

SEMANTICS;

EID: 0035416161     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/11.4.527     Document Type: Article

References (23)

1. A semantics of multiple inheritance
2. On understanding types, data abstraction, and polymorphism
3. {}
4. A semantics for λ& - Early: A calculus with overloading and early binding
5. A calculus for overloaded functions with subtyping
6. A language and axioms for explicit mathematics
7. Constructive theories of functions and classes
8. Iterated inductive fixed-point theories: Application to Hancock's conjecture
9. Polymorphic typed lambda-calculi in a type-free axiomatic framework
10. Logics for termination and correctness of functional programs
11. Logics for termination and correctness of functional programs II: Logics of strength PRA
12. A static type system for late binding overloading
13. Induction in the elementary theory of types and names
14. Type theory and explicit mathematics
15. Applikative Theorien und explizite Mathematik
16. Totality in applicative theories
17. O of explicit mathematics: The limit and Mahlo axioms
18. Towards a theory of type structure
19. Partial applicative theories and explicit substitutions