23 citations · 29 across the 6 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2011★ 2 cited
Constraint solving in non-permutative nominal abstract syntax
Matthew R. Lakin
Nominal abstract syntax is a popular first-order technique for encoding, and reasoning about, abstract syntax involving binders. Many of its applications involve constraint solving…
cs.PL2010★ 1 cited
Stochastic Simulation of Process Calculi for Biology
Andrew Phillips, Matthew Lakin, Loïc Paulevé
Biological systems typically involve large numbers of components with complex, highly parallel interactions and intrinsic stochasticity. To model this complexity, numerous programm…