On Uniquely Closable and Uniquely Typable Skeletons of Lambda Terms

Uniquely closable skeletons of lambda terms are Motzkin-trees that predetermine the unique closed lambda term that can be obtained by labeling their leaves with de Bruijn indices. Likewise, uniquely typable skeletons of closed lambda terms predetermine the unique simply-typed lambda term that can be obtained by labeling their leaves with de Bruijn indices. We derive, through a sequence of logic program transformations, efficient code for their combinatorial generation and study their statistical properties. As a result, we obtain context-free grammars describing closable and uniquely closable skeletons of lambda terms, opening the door for their in-depth study with tools from analytic combinatorics. Our empirical study of the more difficult case of (uniquely) typable terms reveals some interesting open problems about their density and asymptotic behavior. As a connection between the two classes of terms, we also show that uniquely typable closed lambda term skeletons of size $3n+1$ are in a bijection with binary trees of size $n$.Comment: Pre-proceedings paper presented at the 27th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2017), Namur, Belgium, 10-12 October 2017 (arXiv:1708.07854

Evocative computing – creating meaningful lasting experiences in connecting with the past

We present an approach – evocative computing – that demonstrates how ‘at hand’ technologies can be ‘picked up’ and used by people to create meaningful and lasting experiences, through connecting and interacting with the past. The approach is instantiated here through a suite of interactive technologies configured for an indoor-outdoor setting that enables groups to explore, discover and research the history and background of a public cemetery. We report on a two-part study where different groups visited the cemetery and interacted with the digital tools and resources. During their activities serendipitous uses of the technology led to connections being made between personal memo-ries and ongoing activities. Furthermore, these experiences were found to be long-lasting; a follow-up study, one year later, showed them to be highly memorable, and in some cases leading participants to take up new directions in their work. We discuss the value of evocative computing for enriching user experiences and engagement with heritage practices

Waarom is iedereen tegen Gülen?

Middle Eastern Studie

X-ray response of tunnel junctions with a trapping layer

The use of trapping layers in superconductive tunnel junctions may drastically improve their functioning as X-ray detectors. Information about these trapping layers can be obtained from I/V-curves and X-ray spectra. The application of a magnetic field causes a substantial reduction of the bandgap in the trapping layer

Extraneous Background-Correction Program for Matrix Bound Multiple Point X-Ray Microanalysis

A program is described that allows online determination of extraneous background in multiple point X-ray microanalytical matrices. The program is based upon the calculations of the extraneous background for the film (when present), the standard and the unknown by (100 sec.) point analysis. The program searches for a peak-free part of the spectrum in which the calculated value for the extraneous background is about equal to the value in this region of the spectrum (=be). Online the contents of this be-region is subtracted from an unmanipulated continuum region in the vicinity of the element present in the unknown and standard (Pt). During the subsequently performed matrix analysis two arrays are acquired (P-b) and (b-be). From these two arrays, the Rx,st and subsequently the Rx,sp are calculated per pixel, which are converted to (be corrected) concentration arrays. In addition Z2/A-differences between standard and the analyzed specimen are corrected off-line. For each pixel the program judges whether the calculated concentration deviates from the value introduced for the standard. Once differences are registered, adequate corrections are made