Dynamically-Typed Computations for Order-Sorted Equational Presentations (Extended Abstract) (1994)

View PDF

Download Links

by Claus Hintermeier , Claude Kirchner , Hélène Kirchner
Venue:Proc. 21st International Colloquium on Automata, Languages, and Programming, volume 820 of Lecture Notes in Computer Science
Citations:10 - 8 self

Documents Related by Co-Citation

214 Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations – Joseph A. Goguen - 1992
52 Unified algebras and Institutions – P Mosses - 1989
779 Inductive-Data-Type Systems – Frederic Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada - 2002
541 Introduction to HOL: A Theorem Proving Environment for Higher Order Logic.” Cambridge – M J C Gordon, T F Melham - 1993
510 Conditional Rewriting Logic as a Unified Model of Concurrency – J Meseguer - 1992
50 Order-sorted equational computation – G Smolka, W Nutt, J A Goguen, J Meseguer - 1989
433 The Foundation of a Generic Theorem Prover – Lawrence C. Paulson - 1989
879 A formulation of the simple theory of types – A Church - 1940
1184 The Lambda Calculus: Its Syntax and Semantics – H P Barendregt - 1984