Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Information and Computation - Semantics of Data Types
Logic programming in the LF logical framework
Logical frameworks
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Software—Practice & Experience
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Extended static checking for Java
PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Computer-Aided Reasoning: An Approach
Computer-Aided Reasoning: An Approach
Introduction to Algorithms
CLEAN: A language for functional graph writing
Proceedings of the Functional Programming Languages and Computer Architecture
The LOOP Compiler for Java and JML
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Theorem Proving for Functional Programmers
IFL '02 Selected Papers from the 13th International Workshop on Implementation of Functional Languages
Overview of a Theorem-Prover for A Computational Logic
Proceedings of the 8th International Conference on Automated Deduction
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
On Shostak's Decision Procedure for Combinations of Theories
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Simplify: a theorem prover for program checking
Journal of the ACM (JACM)
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Strength Induction in a Haskell Program Verifier
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We use the @r-calculus as an intermediate language to compile functional languages with pattern-matching features, and give an interaction net encoding of the @r-terms arising from the compilation. This encoding gives rise to new strategies of evaluation, ...