Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Wolfram, D. A.
1991.
Rewriting Techniques and Applications.
Vol. 488,
Issue. ,
p.
25.
Avron, Arnon
Honsell, Furio
Mason, Ian A.
and
Pollack, Robert
1992.
Using typed lambda calculus to implement formal systems on a machine.
Journal of Automated Reasoning,
Vol. 9,
Issue. 3,
p.
309.
Groote, Philippe
1993.
STACS 93.
Vol. 665,
Issue. ,
p.
712.
McKinna, James
and
Burstall, Rod
1993.
Mathematical Foundations of Computer Science 1993.
Vol. 711,
Issue. ,
p.
32.
Richards, Bradley L.
Kraan, Ina
Smaill, Alan
and
Wiggins, Geraint A.
1994.
Automated Deduction — CADE-12.
Vol. 814,
Issue. ,
p.
826.
Anlauff, Matthias
Jähnichen, Stefan
and
Simons, Martin
1994.
FME '94: Industrial Benefit of Formal Methods.
Vol. 873,
Issue. ,
p.
421.
Simons, Martin
and
Weber, Matthias
1996.
An approach to literate and structured formal developments.
Formal Aspects of Computing,
Vol. 8,
Issue. 1,
p.
86.
Brown, Jason
and
Wallen, Lincoln A.
1996.
Computer Science Logic.
Vol. 1092,
Issue. ,
p.
106.
Honsell, Furio
and
Miculan, Marino
1996.
Types for Proofs and Programs.
Vol. 1158,
Issue. ,
p.
165.
1998.
Types for Proofs and Programs.
Vol. 1512,
Issue. ,
p.
1.
Bundy, Alan
1999.
Artificial Intelligence Today.
Vol. 1600,
Issue. ,
p.
153.
Adams, A.A.
2000.
A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs.
LMS Journal of Computation and Mathematics,
Vol. 3,
Issue. ,
p.
1.
Bellman, Kirstie L.
and
Landauer, Christopher
2001.
Virtual worlds as meeting places for formal systems.
Applied Mathematics and Computation,
Vol. 120,
Issue. 1-3,
p.
165.
Sato, Masahiko
Kameyama, Yukiyoshi
and
Izumi, Takeuti
2001.
Computer Aided Systems Theory — EUROCAST 2001.
Vol. 2178,
Issue. ,
p.
509.
Stump, Aaron
and
Dill, David L.
2002.
Automated Deduction—CADE-18.
Vol. 2392,
Issue. ,
p.
392.
Sato, Masahiko
2002.
Progress in Discovery Science.
Vol. 2281,
Issue. ,
p.
78.
Flener, Pierre
2002.
Computational Logic: Logic Programming and Beyond.
Vol. 2407,
Issue. ,
p.
310.
Dojen, R.
and
Coffey, T.
2005.
A case study on automation of verification logics.
p.
139.
Schott, Pierre
2011.
How to Introduce the Cyclic Group and Its Properties Representation with Matlab ? Thanks to Magic Using the Perfect Faro Shuffle.
Creative Education,
Vol. 02,
Issue. 01,
p.
27.
Schott, P.
2012.
How to Introduce the Basis of Algorithmics? Thanks to the Enumeration and Composition of All Riffle Shuffles from a N Card Deck Used in MathMagic.
Creative Education,
Vol. 03,
Issue. 04,
p.
540.