This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
C. Amaral , M. Florido and V. Santos Costa
2014. PrologCheck: Property-based testing in Prolog. In Functional and Logic Programming, vol. 8475, M. Codish and E. Sumii , Eds. Lecture Notes in Computer Science, Springer International Publishing, 1–17.
R. Barbuti , P. Mancarella , D. Pedreschi and F. Turini
1990. A transformational approach to negation in logic programming. Journal of Logic Programming
C. Calvès and M. Fernández
2008. A polynomial nominal unification algorithm. Theoretical Computer Science
403, 2–3, 285–306.
2006. Completeness and Herbrand theorems for nominal logic. Journal of Symbolic Logic
71, 1, 299–320.
2010. Equivariant unification. Journal of Automated Reasoning
45, 3, 267–300.
2016. A simple sequent calculus for nominal logic. Journal of Logic and Computation
26, 2, 699–726.
J. Cheney and A. Momigliano
2007. Mechanized metatheory model-checking. In PPDP, M. Leuschel and A. Podelski , Eds. ACM, 75–86.
P. Dybjer , Q. Haiyan and M. Takeyama
2004. Verifying Haskell programs by combining testing, model checking and interactive theorem proving. Information & Software Technology
46, 15, 1011–1025.
2007. Fresh logic: Proof-theory and semantics for FM and nominal techniques. Journal of Applied Logic
5, 2, 356–387.
M. J. Gabbay
2011. Foundations of nominal techniques: Logic and semantics of variables in abstract syntax. Bulletin of Symbolic Logic
17, 2, 161–229.
M. J. Gabbay and A. M. Pitts
2002. A new approach to abstract syntax with variable binding. Formal Aspects of Computing
A. Gacek , D. Miller and G. Nadathur
2012. A two-level logic approach to reasoning about computations. Journal of Automated Reasoning
49, 2, 241–273.
F. Gadducci , M. Miculan and U. Montanari
2006. About permutation algebras, (pre)sheaves and named sets. Higher-Order and Symbolic Computation
19, 2–3, 283–304.
1993. Success and failure for hereditary Harrop formulae. Journal of Logic Programming
17, 1, 1–29.
R. Harper and F. Pfenning
2005. On equivalence and canonical forms in the LF type theory. ACM Transactions on Computational Logic
6, 1, 61–101.
C. Klein , M. Flatt and R. B. Findler
2012b. The Racket virtual machine and randomized testing. Higher-Order and Symbolic Computation
25, 2–4, 209–253.
J.-L. Lassez and K. Marriott
1987. Explicit representation of terms defined by counter examples. Journal of Automated Reasoning
3, 3, 301–318.
J. Levy and M. Villaret
2012. Nominal unification from a higher-order perspective. ACM Transactions on Computational Logic
13, 2, 10:1–10:31.
H. Liu , E. Cheng and P. Hudak
2009. Causal commutative arrows and their optimization. SIGPLAN Notices
44, 9, 35–46.
D. Miller , G. Nadathur , F. Pfenning and A. Scedrov
1991. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic
A. Momigliano and F. Pfenning
2003. Higher-order pattern complement and the strict lambda-calculus. ACM Transactions on Computational Logic
4, 4, 493–529.
2005. Verifying termination and reduction properties about higher-order logic programs. Journal of Automated Reasoning
34, 2, 179–207.
A. M. Pitts
2013. Nominal Sets: Names and Symmetry in Computer Science. Cambridge University Press.
G. Roşu and T. F. Şerbănuţă
2010. An overview of the K semantic framework. Journal of Logic and Algebraic Programming
79, 6, 397–434.
C. Runciman , M. Naylor and F. Lindblad
2008. Smallcheck and lazy SmallCheck: Automatic exhaustive testing for small values. In Haskell Workshop, A. Gill , Ed. ACM, 37–48.
2007. Modelling generic judgements. Electronic Notes in Theoretical Computer Science
174, 5, 19–35.
P. Sewell , F. Z. Nardelli , S. Owens , G. Peskine , T. Ridge , S. Sarkar and R. Strnisa
2010. Ott: Effective tool support for the working semanticist. Journal of Functional Programming
20, 1, 71–122.
P. J. Stuckey
1995. Negation and constraint logic programming. Information and Computation
118, 1, 12–33.
A. Tiu and D. Miller
2010. Proof search specifications of bisimulation and modal logics for the π-calculus. ACM Transactions on Computers Logic
11, 2 (January), 13:1–13:35.
C. Urban , J. Cheney and S. Berghofer
2011. Mechanizing the metatheory of LF. ACM Transactions on Computational Logic
12, 2, Article 15.
C. Urban and C. Kaliszyk
2012. General bindings and alpha-equivalence in Nominal Isabelle. Logical Methods in Computer Science
8, 2, 1–35.
C. Urban , A. M. Pitts and M. J. Gabbay
2004. Nominal unification. Theoretical Computer Science
323, 1–3, 473–497.
D. Volpano , C. Irvine and G. Smith
1996. A sound type system for secure flow analysis. Journal of Computer Security
4, 2–3, 167–187.