Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Tom Maibaum

Known as: Maibaum 
Thomas Stephen Edward Maibaum FRSA (born 18 August 1947 in Hungary) is a computer scientist. Maibaum has an undergraduate degree in Pure Mathematics… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
We propose Example-Driven Modeling (EDM), an approach that systematically uses explicit examples for eliciting, modeling… Expand
2006
2006
Names and name-binding are useful concepts in the theory and practice of formal systems. In this thesis we study them in the… Expand
Review
2003
Review
2003
In Memoriam Armando Martin Haeberer.- In Memoriam Armando Martin Haeberer.- Work at UNU/IIST.- UNU and UNU/IIST.- Contract-Based… Expand
  • table 1
  • figure 8
  • figure 9
  • figure 10
  • table 1
Highly Cited
2001
Highly Cited
2001
This thesis introduces a, new logical system, ordered linear logic, which combines reasoning with unrestricted, linear, and… Expand
  • figure 5.1
  • figure 8.1
1997
1997
In the context of the modular and incremental development of complex systems, viewed as interconnections of interacting… Expand
Highly Cited
1996
Highly Cited
1996
rewriting system, 16 irreflexive, 33 weakly irreflexive, 33 with typing, 37, 40 with very weak typing, 40 with weak typing, 40… Expand
  • table 10.1
  • table 12.1
  • table 13.1
  • table 13.2
Highly Cited
1995
Highly Cited
1995
Interpretation: a Semantic-Based Tool for Program Analysis, in: Handbook of logic in computer science (vol. 4). Oxford University… Expand
1994
1994
Abstract Modern database applications require advanced means for modelling system structure and dynamics. Temporal logic has been… Expand
Highly Cited
1993
Highly Cited
1993
ion, compute a type for its body in an extended context; to compute a type for an application, compute types for its left and… Expand
1976
1976
On caracterise les forets algebriques dont tous les arbres sont de la forme @a(t, t). On utilise cette caracterisation pour… Expand