Name
Abstract | ||
|---|---|---|
Constructive foundations have for decades been built upon realizability models for higher-order logic and type theory. However, traditional realizability models have a rather limited notion of computation, which only supports non-termination and avoids many other commonly used effects. Work to address these limitations has typically overlaid structure on top of existing models, such as by using po... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/LICS52264.2021.9470514 | 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) |
Keywords | DocType | ISBN |
Computer science,Algebra,Computational modeling,Buildings | Conference | 978-1-6654-4895-6 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liron Cohen | 1 | 36 | 11.24 |
| Étienne Miquey | 2 | 0 | 0.34 |
| Ross Tate | 3 | 0 | 0.34 |