On typed calculi with a merge operator

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 880 LNCS, Issue , 1994, Pages 101-112

  Tsuiki, Hideki ^a  

^a KYOTO SANGYO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; DIFFERENTIATION (CALCULUS); MERGERS AND ACQUISITIONS; PATHOLOGY; SOFTWARE ENGINEERING;

MERGE OPERATORS; PROGRAMMING METHODOLOGY; RETURN VALUE; SIMPLY TYPED LAMBDA CALCULUS; STRONG NORMALIZATION; SUBCLASS METHOD; TYPE SYSTEMS;

OBJECT ORIENTED PROGRAMMING;

EID: 85000461360     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58715-2_117     Document Type: Conference Paper

References (15)

1. G. Castagna. A meta-languagc for typed object-orivnted languages. In 13th Conference on the Foundations of Software Technology and Theoretical Computer Science, number 761 in LNCS, Bombay, India, 1993.
2. P. Cardone and M. Coppo. Two extensions of curry's type inference system. In Logic and Computer Science, pp. 19-66, Academic Press. 1990.
3. Giuseppe Castagna, Giorgio Ghelli, and Giuseppe Longo. A calculus for overloaded functions with snbtyping. Information and Computation. Vol. to appear, 1994.
4. R. Hasegawa. Parametricity of extensionally collapsed term models of polymorphism and their categorical properties. In Theoretical Aspects of Computer Software, volume 526 of Lecture Notes in Computer Science, pp. 495-512, 1991.
5. R. Harper and B. Pierce. A record calculus based on symmetric concatenation. In Proc. The Eighteenth Annual Symp. on Principles of Programming Languages, pp. 131-142. 1991.
6. R. Milncr. Fully abstract models of typed λ-calculus. Theoret. Comput. Set, Vol. 4, pp. 1-22, 1977.
7. Geniiaro Monteleone. Generalized conjunctive types. In Proc. The Sixteenth Annual Symposium on Principles of Programming Languors, pp. 242-249. ACM, 1989.
8. A. Ohori and P. Buneman. Type inference in a database programming language. In Proc. ACM Conf, on LISP and Functional Programming, pp. 174-183, 1988.
9. Didier Remy. Typing record concatenation for free. In Proc. The Nineteenth Annual Symposium on Principles of Programming Languages, pp. 166-176. ACM, 1992.
10. J. C. Reynolds. Using category theoiy to design implicit conversions and generic operators. In Lecture Notes in Computer Science, 94. Springer-Verlag. 1981.
11. J. C. Reynolds. Types, abstraction, and parametric polymorphism. In R. E. A. Mason, editor, Information Processing 83. pp. 513 523. North-Holland, 1983.
12. John C. Reynolds. Preliminary design of the programnring language Forsythe. Technical Report CMU-CS-88-159, Carnegie Mellon University, June 1988.
13. Hideki Tsuiki. A Record Calculus with a Merge Operator. PhD thesis, Keio University, 1992.
14. Hideki Tsuiki. A normalizing calculus with overloading and snbtyping. In 2nd Int. Symp. on Theoretical Aspects of Computer Software, LNCS 789, pp. 273-295, 1994.
15. Mitchell Wand. Type inference for record concatenation and multiple inheritance. In Proc. Fourth IEEE Annual Symp. on Logic in Computer Science, pp. 92-97, 1989.