Concrete Generic Functionals

Generic design is not only pertinent to programs, but a fortiori to declarative formalisms as well, and the ensuing generalizations often benefit programming. In the considered framework, generality is obtained by (re)defining traditionally non-functional objects uniformly as functions. This results in intrinsic polymorphism, i.e., designing a collection of functionals without restriction on their arguments makes it intrinsically applicable to all objects captured by the uniformization.

[1]  Bertrand Meyer,et al.  Introduction to the Theory of Programming Languages , 1990 .

[2]  A. Tarski,et al.  A Formalization Of Set Theory Without Variables , 1987 .

[3]  Ellis Horowitz,et al.  The design of data type specifications , 1976, ICSE '76.

[4]  Roland Carl Backhouse,et al.  Logical Relations and Galois Connections , 2002, MPC.

[5]  K. Mani Chandy,et al.  Current trends in programming methodology , 1977 .

[6]  Robert H. Bishop,et al.  Learning with LabVIEW 8 , 1999 .

[7]  Tom Melham,et al.  Theorem Provers in Circuit Design , 1992 .

[8]  Natarajan Shankar,et al.  Subtypes for Specifications: Predicate Subtyping in PVS , 1998, IEEE Trans. Software Eng..

[9]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[10]  Edsger W. Dijkstra,et al.  Predicate Calculus and Program Semantics , 1989, Texts and Monographs in Computer Science.

[11]  K. Hofmann,et al.  A Compendium of Continuous Lattices , 1980 .

[12]  Niklaus Wirth,et al.  Pascal User Manual and Report , 1991, Springer New York.

[13]  Michael Barr,et al.  Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.

[14]  Richard S. Bird,et al.  Introduction to functional programming using haskeu , 1998 .

[15]  John C. Reynolds,et al.  Using category theory to design implicit conversions and generic operators , 1980, Semantics-Directed Compiler Generation.

[16]  J. Michael Spivey,et al.  The Z notation - a reference manual , 1992, Prentice Hall International Series in Computer Science.

[17]  Fred B. Schneider,et al.  A Logical Approach to Discrete Math , 1993, Texts and Monographs in Computer Science.

[18]  Raymond T. Boute,et al.  Fundamentals of Hardware Description Languages and Declarative Languages , 1993 .

[19]  Raymond T. Boute,et al.  Supertotal Function Definition in Mathematics and Software Engineering , 2000, IEEE Trans. Software Eng..

[20]  W. Gareth J. Howells,et al.  Implementation of the Veritas Design Logic , 1992, TPCD.

[21]  Robert D. Tennent,et al.  Semantics of programming languages , 1991, Prentice Hall International Series in Computer Science.

[22]  David Lorge Parnas,et al.  Predicate Logic for Software Engineering , 1993, IEEE Trans. Software Eng..

[23]  Wolfgang Wechler,et al.  Universal Algebra for Computer Scientists , 1992, EATCS Monographs on Theoretical Computer Science.

[24]  David Bernard Guralnik,et al.  Webster's New World dictionary of the American language , 1974 .