Collapsing graph models by preorders
Raymond Hoofman; Harold Schellinx;
Collapsing graph models by preorders
We present a strategy for obtaining extensional (partial) combinatory algebras by slightly modifying the well-known construction of graph models for the untyped lambda calculus. Using the notion of weak cartesian closed category an elegant interpretation of our construction in a category theoretical setting is given.
- University of Amsterdam Netherlands
- Utrecht University Netherlands
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).4 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
selected citations
Citations provided by BIP!
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 4
Average
Top 10%
Top 10%
Related to Research communities
This action will publish the selected files and record in Zenodo. Are you sure you want to proceed?