William M. Farmer

According to our database1, William M. Farmer authored at least 57 papers between 1988 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
The Space of Mathematical Software Systems - A Survey of Paradigmatic Systems.
CoRR, 2020

Leveraging the Information Contained in Theory Presentations.
Proceedings of the Intelligent Computer Mathematics - 13th International Conference, 2020

2019
Big Math and the One-Brain Barrier A Position Paper and Architecture Proposal.
CoRR, 2019

Towards Specifying Symbolic Computation.
Proceedings of the Intelligent Computer Mathematics - 12th International Conference, 2019

2018
Incorporating quotation and evaluation into Church's type theory.
Inf. Comput., 2018

Biform Theories: Project Description.
Proceedings of the Intelligent Computer Mathematics - 11th International Conference, 2018

HOL Light QE.
Proceedings of the Interactive Theorem Proving - 9th International Conference, 2018

A New Style of Mathematical Proof.
Proceedings of the Mathematical Software - ICMS 2018, 2018

2017
Theory Morphisms in Church's Type Theory with Quotation and Evaluation.
Proceedings of the Intelligent Computer Mathematics - 10th International Conference, 2017

Formalizing Mathematical Knowledge as a Biform Theory Graph: A Case Study.
Proceedings of the Intelligent Computer Mathematics - 10th International Conference, 2017

2016
Incorporating Quotation and Evaluation into Church's Type Theory: Syntax and Semantics.
Proceedings of the Intelligent Computer Mathematics - 9th International Conference, 2016

A Formal Language for Writing Contracts.
Proceedings of the 17th IEEE International Conference on Information Reuse and Integration, 2016

2014
Andrews' Type Theory with Undefinedness.
CoRR, 2014

Simple Type Theory with Undefinedness, Quotation, and Evaluation.
CoRR, 2014

Meaning Formulas for Syntax-Based Mathematical Algorithms.
Proceedings of the 6th International Symposium on Symbolic Computation in Software Science, 2014

Realms: A Structure for Consolidating Knowledge about Mathematical Theories.
Proceedings of the Intelligent Computer Mathematics - International Conference, 2014

2013
Chiron: A Set Theory with Types, Undefinedness, Quotation, and Evaluation
CoRR, 2013

Frameworks for Reasoning about Syntax that Utilize Quotation and Evaluation.
CoRR, 2013

The Formalization of Syntax-Based Mathematical Algorithms Using Quotation and Evaluation.
Proceedings of the Intelligent Computer Mathematics, 2013

2011
Mathematical Knowledge Management.
Proceedings of the Encyclopedia of Knowledge Management, Second Edition, 2011

The MathScheme Library: Some Preliminary Experiments
CoRR, 2011

MathScheme: Project Description.
Proceedings of the Intelligent Computer Mathematics - 18th Symposium, 2011

2009
Panoptes: An Exploration Tool for Formal Proofs.
Electron. Notes Theor. Comput. Sci., 2009

A Review of Mathematical Knowledge Management.
Proceedings of the Intelligent Computer Mathematics, 2009

2008
The seven virtues of simple type theory.
J. Appl. Log., 2008

High-Level Theories.
Proceedings of the Intelligent Computer Mathematics, 9th International Conference, 2008

2007
Biform Theories in Chiron.
Proceedings of the Towards Mechanized Mathematical Assistants, 14th Symposium, 2007

A Rational Reconstruction of a System for Experimental Mathematics.
Proceedings of the Towards Mechanized Mathematical Assistants, 14th Symposium, 2007

2006
Proceedings of the Seventeen Provers of the World, Foreword by Dana S. Scott, 2006

2005
Preface.
Proceedings of the 12th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, 2005

2004
MKM: a new interdisciplinary field of research.
SIGSAM Bull., 2004

Formalizing Undefinedness Arising in Calculus.
Proceedings of the Automated Reasoning - Second International Joint Conference, 2004

2003
An Overview of a Formal Framework for Managing Mathematics.
Ann. Math. Artif. Intell., 2003

2001
STMM: A Set Theory for Mechanized Mathematics.
J. Autom. Reasoning, 2001

2000
A Set Theory with Support for Partial Functions.
Studia Logica, 2000

An Infrastructure for Intertheory Reasoning.
Proceedings of the Automated Deduction, 2000

1999
A Scheme for Defining Partial Higher-Order Functions by Recursion.
Proceedings of the 3rd Irish Workshop on Formal Methods, Galway, Ireland, July 1999, 1999

1996
For a Massive Number of Massively Parallel Machines: What are the Target Applications, Who are the Target Users, and What New R&D is Needed to Hit the Target?
Proceedings of IPPS '96, 1996

Security for Mobile Agents: Authentication and State Appraisal.
Proceedings of the Computer Security, 1996

IMPS: An Updated System Description.
Proceedings of the Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996

1995
Context in Mathematical Reasoning and Computation.
J. Symb. Comput., 1995

1994
Proof Script Pragmatics in IMPS.
Proceedings of the Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26, 1994

1993
IMPS: An Interactive Mathematical Proof System.
J. Autom. Reasoning, 1993

A Simple Type Theory with Partial Functions and Subtypes.
Ann. Pure Appl. Log., 1993

Theory Interpretation in Simple Type Theory.
Proceedings of the Higher-Order Algebra, 1993

Reasoning with Contexts.
Proceedings of the Design and Implementation of Symbolic Computation Systems, 1993

1992
The Kreisel Length-of-Proof Problem.
Ann. Math. Artif. Intell., 1992

IMPS: System Description.
Proceedings of the Automated Deduction, 1992

Little Theories.
Proceedings of the Automated Deduction, 1992

1991
Simple Second-order Languages for which Unification is Undecidable.
Theor. Comput. Sci., 1991

A Unification-Theoretic Method for Investigating the k-Provability Problem.
Ann. Pure Appl. Log., 1991

Redex Capturing in Term Graph Rewriting (Concise Version).
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

1990
A Correctness Proof for Combinator Reduction with Cycles.
ACM Trans. Program. Lang. Syst., 1990

A Partial Functions Version of Church's Simple Theory of Types.
J. Symb. Log., 1990

Redex Capturing in Term Graph Rewriting.
Int. J. Found. Comput. Sci., 1990

1989
Minutes of the 4th annual LICS business meeting.
SIGACT News, 1989

1988
A unification algorithm for second-order monadic terms.
Ann. Pure Appl. Log., 1988


  Loading...