Pablo Nogueira

Permanent Lecturer

Publications

2024

1. Equivalence of eval-readback and eval-apply big-step evaluators by structuring the lambda-calculus’s strategy space

   Nogueira, P., & Garcı́a-Pérez. (2024). Equivalence of eval-readback and eval-apply big-step evaluators by structuring the lambda-calculus’s strategy space. Log. Methods Comput. Sci., 20(4).

2022

1. Equivalence of eval-readback and eval-apply big-step evaluators by regimentation of the lambda-calculus’s strategy space

   Nogueira, P., & Garcı́a-Pérez. (2022). Equivalence of eval-readback and eval-apply big-step evaluators by regimentation of the lambda-calculus’s strategy space. CoRR, abs/2212.02494.

2019

1. The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus

   Garcı́a-Pérez, & Nogueira, P. (2019). The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus. J. Funct. Program., 29, e7.

2016

1. No solvable lambda-value term left behind

   Garcı́a-Pérez, & Nogueira, P. (2016). No solvable lambda-value term left behind. Log. Methods Comput. Sci., 12(2).

2014

1. Selected papers from Mathematics of Program Construction 2012

   Gibbons, J., & Nogueira, P. (2014). Selected papers from Mathematics of Program Construction 2012. Sci. Comput. Program., 85, 101.
2. On the syntactic and functional correspondence between hybrid (or layered) normalisers and abstract machines

   Garcı́a-Pérez, & Nogueira, P. (2014). On the syntactic and functional correspondence between hybrid (or layered) normalisers and abstract machines. Sci. Comput. Program., 95, 176–199.
3. Deriving interpretations of the gradually-typed lambda calculus

   Garcı́a-Pérez, Nogueira, P., & Sergey, I. (2014). Deriving interpretations of the gradually-typed lambda calculus. In W.-N. Chin & J. Hage (Eds.), Proceedings of the ACM SIGPLAN 2014 workshop on Partial evaluation and program manipulation, PEPM 2014, January 20-21, 2014, San Diego, California, USA (pp. 157–168). ACM.

2013

1. A syntactic and functional correspondence between reduction semantics and reduction-free full normalisers

   Garcı́a-Pérez, & Nogueira, P. (2013). A syntactic and functional correspondence between reduction semantics and reduction-free full normalisers. In E. Albert & S.-C. Mu (Eds.), Proceedings of the ACM SIGPLAN 2013 Workshop on Partial Evaluation and Program Manipulation, PEPM 2013, Rome, Italy, January 21-22, 2013 (pp. 107–116). ACM.
2. Deriving the full-reducing Krivine machine from the small-step operational semantics of normal order

   Garcı́a-Pérez, Nogueira, P., & Moreno-Navarro, J. J. (2013). Deriving the full-reducing Krivine machine from the small-step operational semantics of normal order. In R. Peña & T. Schrijvers (Eds.), 15th International Symposium on Principles and Practice of Declarative Programming, PPDP ’13, Madrid, Spain, September 16-18, 2013 (pp. 85–96). ACM.

2012

1. Mathematics of Program Construction - 11th International Conference, MPC 2012, Madrid, Spain, June 25-27, 2012. Proceedings

   Gibbons, J., & Nogueira, P. (Eds.). (2012). Mathematics of Program Construction - 11th International Conference, MPC 2012, Madrid, Spain, June 25-27, 2012. Proceedings (Vol. 7342). Springer.

2011

1. First-order unification using variable-free relational algebra

   Arias, E. J. G., Lipton, J., Mariño, J., & Nogueira, P. (2011). First-order unification using variable-free relational algebra. Log. J. IGPL, 19(6), 790–820.

2008

1. Bialgebra views: a way for polytypic programming to cohabit with data abstraction

   Nogueira, P., & Moreno-Navarro, J. J. (2008). Bialgebra views: a way for polytypic programming to cohabit with data abstraction. In R. Hinze & D. Syme (Eds.), Proceedings of the ACM SIGPLAN Workshop on Generic Programming, WGP 2008, Victoria, BC, Canada, September 20, 2008 (pp. 61–73). ACM.
2. First-order unification using variable-free relational algebra

   Arias, E. J. G., Lipton, J., Mariño, J., & Nogueira, P. (2008). First-order unification using variable-free relational algebra. In M. Marin (Ed.), Proceedings of the 22nd International Workshop on Unification, UNIF 2008, Castle of Hagenberg, Austria, July 18, 2008 (pp. 40–54).

2006

1. Context-parametric polykinded types

   Nogueira, P. (2006). Context-parametric polykinded types. In R. Hinze (Ed.), Proceedings of the ACM SIGPLAN Workshop on Generic Programming, WGP 2006, Portland, Oregon, USA, September 16, 2006 (pp. 45–54). ACM.
2. When is an abstract data type a functor?

   Nogueira, P. (2006). When is an abstract data type a functor? In H. Nilsson (Ed.), Revised Selected Papers from the Seventh Symposium on Trends in Functional Programming, TFP 2006, Nottingham, United Kingdom, 19-21 April 2006 (Vol. 7, pp. 217–231). Intellect.