A PDP-12 interface for time-code generator/readers

Stephen Walker; Martin Reite

doi:10.3758/bf03205376

A PDP-12 interface for time-code generator/readers

Behavior Research Methods ◽

10.3758/bf03205376 ◽

1978 ◽

Vol 10 (5) ◽

pp. 710-711

Author(s):

Stephen Walker ◽

Martin Reite

Keyword(s):

Time Code ◽

Code Generator

Download Full-text

An integrated circuit time code generator

Microelectronics Reliability ◽

10.1016/0026-2714(69)90192-9 ◽

1969 ◽

Vol 8 (1) ◽

pp. 75

Keyword(s):

Integrated Circuit ◽

Time Code ◽

Code Generator

Download Full-text

A microprocessor controlled time code generator for an OBS system.

Journal of Physics of the Earth ◽

10.4294/jpe1952.28.281 ◽

1980 ◽

Vol 28 (3) ◽

pp. 281-292 ◽

Cited By ~ 7

Author(s):

Hideki INATANI ◽

Itsuo FURUYA

Keyword(s):

Time Code ◽

Code Generator

Download Full-text

Design Report for the Synchronized Position, Velocity, and Time Code Generator

10.21236/ada624904 ◽

2015 ◽

Author(s):

Brian T. Mays

Keyword(s):

Time Code ◽

Code Generator

Download Full-text

A Unifying Approach to Goal-Directed Evaluation

BRICS Report Series ◽

10.7146/brics.v8i29.21689 ◽

2001 ◽

Vol 8 (29) ◽

Author(s):

Olivier Danvy ◽

Bernd Grobauer ◽

Morten Rhiger

Keyword(s):

Partial Evaluation ◽

Time Analysis ◽

Time Code ◽

Code Generator ◽

C Programs ◽

Binding Time ◽

Run Time ◽

Church Encoding ◽

Binding Time Analysis

Goal-directed evaluation, as embodied in Icon and Snobol, is built on the notions of backtracking and of generating successive results, and therefore it has always been something of a challenge to specify and implement. In this article, we address this challenge using computational monads and partial evaluation.<br /> <br />We consider a subset of Icon and we specify it with a monadic semantics and a list monad. We then consider a spectrum of monads that also fit the bill, and we relate them to each other. For example, we derive a continuation monad as a Church encoding of the list monad. The resulting semantics coincides with Gudeman's continuation semantics of Icon.<br /> <br />We then compile Icon programs by specializing their interpreter (i.e., by using the first Futamura projection), using type-directed partial evaluation. Through various back ends, including a run-time code generator, we generate ML code, C code, and OCaml byte code. Binding-time analysis and partial evaluation of the continuation-based interpreter automatically give rise to C programs that coincide with the result of Proebsting's optimized compiler.

Download Full-text