HimML: Standard ML with Fast Sets and Maps (1994)

Cached

Download Links

by Jean Goubault
Venue:In 5th ACM SIGPLAN Workshop on ML and its Applications
Citations:7 - 2 self

Documents Related by Co-Citation

2927 Graph-based algorithms for Boolean function manipulation – Randal E. Bryant - 1986
98 Seventy-five Problems for Testing Automatic Theorem Provers – F J Pelletier - 1986
7 Deduktion mit Shannongraphen fur Pradikatenlogik erster Stufe – J POSEGGA - 1993
410 First-Order Logic and Automated Theorem Proving. 2nd edition – Melvin Fitting - 1996
13 Perfect normal forms for discrete functions – J-P Billon - 1987
6 The even more liberalized ffi -rule in free variable semantic tableaux – Bernhard Beckert, H ahnle, Reiner - 1993
4 The HimML reference manual – J Goubault - 1993
2 Grundlagen der Mathematik II, volume 50 of Die Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen mit besonderer Berucksichtigung der Anwendungsgebiete – David Hilbert, Paul Bernays - 1939
15 The even more liberalized ffi-rule in free variable semantic tableaux – B Beckert, R Hahnle, P H Schmitt - 1993
23 On skolemization and proof complexity – A Leitsch M Baaz - 1994
13 Reduce 2: A system and language for algebraic manipulation – URL http comjnl oxfordjournals orgcontent222127 abstract Hearn, A C - 1971
311 An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof (2nd Ed – Peter B Andrews - 2002
9 Two level logic minimization – Tsutomu Sasao
76 The Decision Problem - Solvable Classes of Quantified Formulas – B Dreben, W Goldfarb - 1986
283 The Lambda Calculus: Its Syntax and Semantics. Volume 103 – H P Barendregt - 1984
112 SATCHMO: a theorem prover implemented in Prolog – Rainer Manthey
3 A BDD-Based Simplification and Skolemization Procedure – Jean Goubault - 1995
3 Permutability of inferences – S C Kleene - 1952
7 D'emonstration automatique en logique classique : complexit'e et m'ethodes – J Goubault - 1993