Satchmo - The Compiling and Functional Variants

  • Authors:
  • Tim Geisler;Sven Panne;Heribert Schütz

  • Affiliations:
  • Institut für Informatik, Universität München, München, Germany. e-mail: {Tim.Geisler,Sven.Panne,Heribert.Schuetz}@informatik.uni-muenchen.de;Institut für Informatik, Universität München, München, Germany. e-mail: {Tim.Geisler,Sven.Panne,Heribert.Schuetz}@informatik.uni-muenchen.de;Institut für Informatik, Universität München, München, Germany. e-mail: {Tim.Geisler,Sven.Panne,Heribert.Schuetz}@informatik.uni-muenchen.de

  • Venue:
  • Journal of Automated Reasoning
  • Year:
  • 1997

Quantified Score

Hi-index 0.01

Visualization

Abstract

Compiling Satchmo and Functional Satchmo are two variants of the model generator Satchmo, incorporating enhancements in different directions. Compiling Satchmo is based on the observation that Satchmo (like any model generator or theorem prover) can be seen as an interpreter for a program given as a logical theory, and that this interpretation layer can be avoided by compilation of the theory into a directly executable program. Functional Satchmo is an implementation of Satchmo’s calculus in a purely functional language supporting lazy evaluation.