[HTML][HTML] The seven virtues of simple type theory

WM Farmer - Journal of Applied Logic, 2008 - Elsevier
Simple type theory, also known as higher-order logic, is a natural extension of first-order
logic which is simple, elegant, highly expressive, and practical. This paper surveys the …

A combinator-based superposition calculus for higher-order logic

A Bhayat, G Reger - International Joint Conference on Automated …, 2020 - Springer
We present a refutationally complete superposition calculus for a version of higher-order
logic based on the combinatory calculus. We also introduce a novel method of dealing with …

Fast Automated Reasoning over String Diagrams using Multiway Causal Structure

J Gorard, M Namuduri, XD Arsiwalla - arxiv preprint arxiv:2105.04057, 2021 - arxiv.org
We introduce an intuitive algorithmic methodology for enacting automated rewriting of string
diagrams within a general double-pushout (DPO) framework, in which the sequence of …

A Hoare logic for call-by-value functional programs

Y Régis-Gianas, F Pottier - International Conference on Mathematics of …, 2008 - Springer
We present a Hoare logic for a call-by-value programming language equipped with
recursive, higher-order functions, algebraic data types, and a polymorphic type system in the …

MBase: Representing knowledge and context for the integration of mathematical software systems

M Kohlhase, A Franke - Journal of Symbolic Computation, 2001 - Elsevier
In this article we describe the data model of the MB ase system, a web-based, distributed
mathematical knowledge base. This system is a mathematical service in MathWeb that offers …

Hybrid contract checking via symbolic simplification

DN Xu - Proceedings of the ACM SIGPLAN 2012 workshop on …, 2012 - dl.acm.org
Program errors are hard to detect or prove absent. Allowing programmers to write formal and
precise specifications, especially in the form of contracts, is a popular approach to program …