Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5535524> ?p ?o }
Showing triples 1 to 23 of
23
with 100 triples per page.
- Q5535524 subject Q13268054.
- Q5535524 subject Q7131143.
- Q5535524 subject Q7452060.
- Q5535524 subject Q7464734.
- Q5535524 subject Q8728647.
- Q5535524 abstract "The Geometry of Interaction (GoI) was introduced by Jean-Yves Girard shortly after his work on Linear logic. In linear logic, proofs can be seen as various kinds of networks as opposed to the flat tree structures of sequent calculus. To distinguish the real proof nets from all the possible networks, Girard devised a criterium involving trips in the network. Trips can in fact be seen as some kind of operator acting on the proof. Drawing from this observation, Girard described directly this operator from the proof and has given a formula, the so-called execution formula, encoding the process of cut elimination at the level of operators.One of the first significant applications of GoI was a better analysis of Lamping's algorithm for optimal reduction for the lambda calculus. GoI had a strong influence on game semantics for linear logic and PCF.GoI has been applied to deep compiler optimisation for lambda calculi. A bounded version of GoI dubbed the Geometry of Synthesis has been used to compile higher-order programming languages directly into static circuits.".
- Q5535524 wikiPageExternalLink siena07.pdf.
- Q5535524 wikiPageWikiLink Q1208485.
- Q5535524 wikiPageWikiLink Q131030.
- Q5535524 wikiPageWikiLink Q13268054.
- Q5535524 wikiPageWikiLink Q1771121.
- Q5535524 wikiPageWikiLink Q242028.
- Q5535524 wikiPageWikiLink Q3087821.
- Q5535524 wikiPageWikiLink Q3457091.
- Q5535524 wikiPageWikiLink Q376166.
- Q5535524 wikiPageWikiLink Q7131143.
- Q5535524 wikiPageWikiLink Q7248484.
- Q5535524 wikiPageWikiLink Q7452060.
- Q5535524 wikiPageWikiLink Q7464734.
- Q5535524 wikiPageWikiLink Q841728.
- Q5535524 wikiPageWikiLink Q8728647.
- Q5535524 comment "The Geometry of Interaction (GoI) was introduced by Jean-Yves Girard shortly after his work on Linear logic. In linear logic, proofs can be seen as various kinds of networks as opposed to the flat tree structures of sequent calculus. To distinguish the real proof nets from all the possible networks, Girard devised a criterium involving trips in the network. Trips can in fact be seen as some kind of operator acting on the proof.".
- Q5535524 label "Geometry of interaction".