A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
The Definitional Side of the Forcing
2016
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16
This paper studies forcing translations of proofs in dependent type theory, through the Curry-Howard correspondence. Based on a call-by-push-value decomposition, we synthesize two simply-typed translations: i) one call-by-value, corresponding to the translation derived from the presheaf construction as studied in a previous paper; ii) one call-by-name, whose intuitions already appear in Krivine and Miquel's work. Focusing on the call-by-name translation, we adapt it to the dependent case and
doi:10.1145/2933575.2935320
dblp:conf/lics/JaberLPST16
fatcat:nnumvblstngtrbfjrc5t74laxu