CTP-based programming languages?
Authors:
Open Access
- 29 July 2010
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Communications in Computer Algebra
- Vol. 44 (1/2) , 27-41
Abstract
This paper discusses plans for joint work in order to gain early feedback from the community. Three lines of work pursued independently so far shall be joined: (1) narrowing the gap between declarative program specification and program generation already working in Isabelle, (2) reusing work, which embedded an input-response-loop resembling Computer Algebra Systems (CAS) into HOL Light, and (3) reconstructing an experimental language for applied mathematics by exploiting established as well as emerging features of Isabelle/Isar. These plans have to be seen as part of a variety of highly active research areas -- on "integration of the deduction and the computational power" of Computer Theorem Proving (CTP) and CAS respectively (Calculemus), on "innovative theoretical and technological solutions for content-based systems" (MKM), on "Programming Languages for Mechanized Mathematics Systems" (PLMMS), just to cite from some related interest groups. Facing the abundant variety of approaches, of intermediate results and of ongoing developments, and taking under consideration the many difficulties in integrating such approaches, we pursue pragmatic goals: Design a component indispensable for working engineers, a programming language for engineering applications. Use Isabelle for an experimental embedding of the language, which is useful at least in engineering education as soon as possible.Keywords
This publication has 15 references indexed in Scilit:
- Proving Bounds on Real-Valued Functions with Computations2008
- Automating Side Conditions in Formalized Partial Functions2008
- Computational Origami Construction as Constraint Solving and RewritingElectronic Notes in Theoretical Computer Science, 2008
- Real Number Calculations and Theorem Proving2008
- Certified Computer Algebra on Top of an Interactive Theorem ProverLecture Notes in Computer Science, 2007
- Biform Theories in ChironLecture Notes in Computer Science, 2007
- Not seeing the roots for the branchesACM SIGSAM Bulletin, 2004
- Organizing Numerical Theories Using Axiomatic Type ClassesJournal of Automated Reasoning, 2004
- Deduction as an Engineering ScienceElectronic Notes in Theoretical Computer Science, 2003
- On the formalization of programming languages: Early history and main approaches1978