Deriving structural induction in LCF.
Proc. of the international symposium on Semantics of data types
The computer modelling of mathematical reasoning
The computer modelling of mathematical reasoning
Journal of the ACM (JACM)
A Practical Decision Procedure for Arithmetic with Function Symbols
Journal of the ACM (JACM)
A Deductive Approach to Program Synthesis
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Cornell program synthesizer: a syntax-directed programming environment
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
The Science of Programming
The Craft of Programming
Systematic Programming: An Introduction
Systematic Programming: An Introduction
A Discipline of Programming
An Introduction to the PL/CV2 Programming Logic
An Introduction to the PL/CV2 Programming Logic
Proceedings of the 6th Conference on Automated Deduction
STP: A Mechanized Logic for Specification and Verification
Proceedings of the 6th Conference on Automated Deduction
Programming in Constructive Set Theory: Some examples
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
A logic for correct program development
A logic for correct program development
Avid: a system for the interactive development of verifiably correct programs
Avid: a system for the interactive development of verifiably correct programs
Using induction to design algorithms
Communications of the ACM
ICSE '88 Proceedings of the 10th international conference on Software engineering
Type theories and object-oriented programmimg
ACM Computing Surveys (CSUR)
SDE 4 Proceedings of the fourth ACM SIGSOFT symposium on Software development environments
Rules and strategies for transforming functional and logic programs
ACM Computing Surveys (CSUR)
Future directions in program transformation
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Foundations for the implementation of higher-order subtyping
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Implementing first order logic in Modula-2 using an intuitionistic approach
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Modeling a Hardware Synthesis Methodology in Isabelle
Formal Methods in System Design
Using dependent types to express modular structure
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Warshall Algorithm and Dickson's Lemma: Two Examples of Realistic Program Extraction
Journal of Automated Reasoning
Achievements and Prospects of Program Synthesis
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Synthesis of Programs in Abstract Data Types
LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation
Deriving Modular Programs from Short Proofs
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Decision Planning Knowledge Representation Framework: A Case-Study
Annals of Mathematics and Artificial Intelligence
Proof planning for maintainable configuration systems
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Automated complexity analysis of Nuprl extracted programs
Journal of Functional Programming
Transparent optimisation of rewriting combinators
Journal of Functional Programming
Automated higher-order complexity analysis
Theoretical Computer Science - Implicit computational complexity
Alchemy: transmuting base alloy specifications into implementations
Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
HasCasl: Integrated higher-order specification and program development
Theoretical Computer Science
Thinking about computational thinking
Proceedings of the 40th ACM technical symposium on Computer science education
Component Specification Using Event Classes
CBSE '09 Proceedings of the 12th International Symposium on Component-Based Software Engineering
Towards an Operational Semantics for Alloy
FM '09 Proceedings of the 2nd World Congress on Formal Methods
A Constructive Object Oriented Modeling Language for Information Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Light functional interpretation
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Automating Inductive Specification Proofs
Fundamenta Informaticae
| Hi-index | 0.02 |
The significant intellectual cost of programming is for problem solving and explaining, not for coding. Yet programming systems offer mechanical assistance for the coding process exclusively. We illustrate the use of an implemented program development system, called PRL ("pearl"), that provides automated assistance with the difficult part. The problem and its explained solution are seen as formal objects in a constructive logic of the data domains. These formal explanations can be executed at various stages of completion. The most incomplete explanations resemble applicative programs, the most complete are formal proofs.