The TH ∃ OREM ∀ project: a progress report
Symbolic computation and automated reasoning
The Definition of Standard ML
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
On the Formalization of Programming Languages: Early History and Main Approaches
The Vienna Development Method: The Meta-Language
Formal Methods in the Railways Signalling Industry
FME '94 Proceedings of the Second International Symposium of Formal Methods Europe on Industrial Benefit of Formal Methods
Validation of a Railway Interlocking Model
FME '94 Proceedings of the Second International Symposium of Formal Methods Europe on Industrial Benefit of Formal Methods
PVS: Combining Specification, Proof Checking, and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Not seeing the roots for the branches: multivalued functions in computer algebra
ACM SIGSAM Bulletin
Organizing Numerical Theories Using Axiomatic Type Classes
Journal of Automated Reasoning
Computational Origami Construction as Constraint Solving and Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Certified Computer Algebra on Top of an Interactive Theorem Prover
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Formalizing Desargues' theorem in Coq using ranks
Proceedings of the 2009 ACM symposium on Applied Computing
Formal semantics of programming languages: VDL
IBM Journal of Research and Development
Testing and verifying invariant based programs in the SOCOS environment
TAP'07 Proceedings of the 1st international conference on Tests and proofs
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Partial recursive functions in higher-order logic
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Code generation via higher-order rewrite systems
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
A scheme for defining partial higher-order functions by recursion
IW-FM'99 Proceedings of the 3rd Irish conference on Formal Methods
| Hi-index | 0.00 |
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.