We present the Lambda Context Calculus. This simple lambda-calculus features variables arranged in a hierarchy of strengths such that substitution of a strong variable does not avoid capture with respect to abstraction by a weaker variable. This allows the calculus to express both capture-avoiding and capturing substitution (instantiation). The reduction rules extend the ‘vanilla’ lambda-calcul...

This paper examines extensions by Dretske, Barwise, Seligman and others to the Shannon-Weaver model of information communication, with special reference to geographic information. Classifications of entities into types are taken as the basis for information repositories, while structure-preserving mappins called infomorphism provide the linkages. A key notion is that of a channel, which can be ...

Social interaction and loneliness have received much research interest. However, the direction of their relationship is unclear—does social shape loneliness, or does willingness to interact? We explored dynamics these experiences under exceptional circumstances: COVID-19 lockdowns, which were necessary for public health but impacted people’s lives. investigated between in out lockdown Australia...

Lam (2007) introduces a generalization of renewal processes named Geometric processes, where inter-arrival times are independent and identically distributed up to a multiplicative scale parameter, in a geometric fashion. We here envision a more general scaling, not necessar- ily geometric. The corresponding counting process is named Extended Geometric Process (EGP). Semiparametric estimates are...

Many context-sensitive dataflow analyses can be formulated as an extended Dyck-CFL reachability problem, where function calls and returns are modeled partially matched parentheses. Unfortunately, despite many works on the standard solving version is still of quadratic space complexity nearly cubic time complexity, significantly limiting scalability program analyses. This paper, for first to bes...