Jeremy E. Dawson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2021

A Formally Verified Cut-Elimination Procedure for Linear Nested Sequents for Tense LogicCaitlin D'Abrera, Jeremy E. Dawson, Rajeev Goré. tableaux 2021: 281-298 [doi]

2018

Well-Founded UnionsJeremy E. Dawson, Nachum Dershowitz, Rajeev Goré. cade 2018: 117-133 [doi]

2017

Issues in Machine-Checking the Decidability of Implicational Ticket EntailmentJeremy E. Dawson, Rajeev Goré. tableaux 2017: 347-363 [doi]

2016

Machine-Checked Interpolation Theorems for Substructural Logics Using Display CalculiJeremy E. Dawson, James Brotherston, Rajeev Goré. cade 2016: 452-468 [doi]

2015

Machine-Checked Reasoning About Complex Voting Schemes Using Higher-Order LogicJeremy E. Dawson, Rajeev Goré, Thomas Meumann. voteid 2015: 142-158 [doi]

2014

From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear LogicJeremy E. Dawson, Ranald Clouston, Rajeev Goré, Alwen Tiu. ifipTCS 2014: 250-264 [doi]

2013

Annotation-Free Sequent Calculi for Full Intuitionistic Linear LogicRanald Clouston, Jeremy E. Dawson, Rajeev Goré, Alwen Tiu. csl 2013: 197-214 [doi]

2010

Generic Methods for Formalising Sequent Calculi Applied to Provability LogicJeremy E. Dawson, Rajeev Goré. lpar 2010: 263-277 [doi]

Automating Open Bisimulation Checking for the Spi CalculusAlwen Tiu, Jeremy E. Dawson. csfw 2010: 307-321 [doi]

2009

Formalising Observer Theory for Environment-Sensitive BisimulationJeremy E. Dawson, Alwen Tiu. tphol 2009: 180-195 [doi]

Termination of Abstract Reduction SystemsJeremy E. Dawson, Rajeev Goré. ijfcs, 20(1):57-82, 2009. [doi]

2007

Compound monads in specification languagesJeremy E. Dawson. plpv 2007: 3-10 [doi]

Formalising Generalised SubstitutionsJeremy E. Dawson. tphol 2007: 54-69 [doi]

Termination of Abstract Reduction SystemsJeremy E. Dawson, Rajeev Goré. cats 2007: 35-43 [doi]

2004

Formalising General CorrectnessJeremy E. Dawson. ENTCS, 91:21-42, 2004. [doi]

A General Theorem on Termination of RewritingJeremy E. Dawson, Rajeev Goré. csl 2004: 100-114 [doi]

2003

A New Machine-checked Proof of Strong Normalisation for Display LogicJeremy E. Dawson, Rajeev Goré. ENTCS, 78:20-39, 2003. [doi]

2002

Machine-Checking the Timed Interval CalculusJeremy E. Dawson, Rajeev Goré. ausai 2002: 95-106 [doi]

Formalised Cut Admissibility for Display LogicJeremy E. Dawson, Rajeev Goré. tphol 2002: 131-147 [doi]

2001

Embedding Display Calculi into Logical Frameworks: Comparing Twelf and IsabelleJeremy E. Dawson, Rajeev Goré. TCS, 42:89-103, 2001. [doi]

2000

1999

Optimizing User-Level Communication Patterns on the Fujitsu AP3000Jeremy E. Dawson, Peter E. Strazdins. iwcc 1999: 105-111 [doi]

1998

A Mechanisation of Classical Modal Tense Logics Using IsabelleJeremy E. Dawson, Rajeev Goré. ausai 1998: 107-118

A Mechanised Proof System for Relation Algebra using Display LogicJeremy E. Dawson, Rajeev Goré. jelia 1998: 264-278 [doi]

1994

An Asymptotic Result on the Existence of Generalised Hadamard MatricesWarwick de Launey, Jeremy E. Dawson. JCT, 65(1):158-163, 1994.

1992

A note on the construction of GH(4tq, EA(q)) for t=1, 2Warwick de Launey, Jeremy E. Dawson. ajc, 6:177-186, 1992. [doi]

1985

Decomposition of binary matroidsJeremy E. Dawson. combinatorica, 5(1):1-9, 1985.

Independence Spaces and Uniform ModulesJeremy E. Dawson. ejc, 6(1):29-36, 1985. [doi]

Independence Structures on the Submodules of a ModuleJeremy E. Dawson. ejc, 6(1):37-44, 1985. [doi]

1984

The directed packing numbers DD (t, v, v), t>=;4Jeremy E. Dawson, Jennifer Seberry, David B. Skillicorn. combinatorica, 4(2):121-130, 1984.

Sign in or sign up to see more results.

runs on WebDSL