@InProceedings{miquey:LIPIcs.CSL.2020.30,
  author =	{Miquey, \'{E}tienne},
  title =	{{Revisiting the Duality of Computation: An Algebraic Analysis of Classical Realizability Models}},
  booktitle =	{28th EACSL Annual Conference on Computer Science Logic (CSL 2020)},
  pages =	{30:1--30:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-132-0},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{152},
  editor =	{Fern\'{a}ndez, Maribel and Muscholl, Anca},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.30},
  URN =		{urn:nbn:de:0030-drops-116734},
  doi =		{10.4230/LIPIcs.CSL.2020.30},
  annote =	{Keywords: realizability, model theory, forcing, proofs-as-programs, \lambda-calculus, classical logic, duality, call-by-value, call-by-name, lattices, tripos}
}