ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Monograph available for loan
    Monograph available for loan
    Essentials of programming languages (2001)
    Cambridge : MIT Press
    Details Availability
    Call number: PIK M 032-01-0539
    Type of Medium: Monograph available for loan
    Pages: 408 p.
    Edition: 2. ed.
    ISBN: 0262062178
    Location: A 18 - must be ordered
    Branch Library: PIK Library
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    BOOK
    Link to Library Catalog
    get availability status
  • 2
    Electronic Resource
    Electronic Resource
    The one-bit reference count (1977)
    Springer
    BIT 17 (1977), S. 351-359 
    Details
    ISSN: 1572-9125
    Keywords: garbage collection ; storage management ; assignment statement ; 4.19 ; 4.34
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Deutsch and Bobrow propose a storage reclamation scheme for a heap which is a hybrid of garbage collection and reference counting. The point of the hybrid scheme is to keep track of very low reference counts between necessary invocation of garbage collection so that nodes which are allocated and rather quickly abandoned can be returned to available space, delaying necessity for garbage collection. We show how such a scheme may be implemented using the mark bit already required in every node by the garbage collector. Between garbage collections that bit is used to distinguish nodes with a reference count known to be one. A significant feature of our scheme is a small cache of references to nodes whose implemented counts “ought to be higher” which prevents the loss of logical count information in simple manipulations of uniquely referenced structures.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01932156
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Boolean-valued loops (1975)
    Springer
    BIT 15 (1975), S. 431-451 
    Details
    ISSN: 1572-9125
    Keywords: 4.22 ; 5.24 ; 4.43 ; 4.12
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A new control structure construct, thewhile-until, is introduced as a syntactic combination of thewhile statement and therepeat-until statement. Examples show that the use of thewhile-until can lead to structured programs that are conceptually more manageable than those attainable without it. Thewhile-until statement is then extended to a value-returning expression which is shown to be more powerful than the classical looping structures. It is shown to be equivalent in power to those structures withexit when a value-returningif-then-else is allowed. As a consequence, there are flowcharts whose implementations require control structures stronger than thewhile-until. Implementation details are discussed and Hoare-like axioms are presented. A closing discussion on oesthetics discourages some natural generalizations, but it concludes that the basicwhile-until is convenient for all parties on a programming team: coder, reader, compiler, and validator.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01931683
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    The mystery of the tower revealed: A nonreflective description of the reflective tower (1988)
    Springer
    Higher-order and symbolic computation 1 (1988), S. 11-38 
    Details
    ISSN: 1573-0557
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In an important series of papers [8, 9], Brian Smith has discussed the nature of programs that know about their text and the context in which they are executed. He called this kind of knowledgereflection. Smith proposed a programming language, called 3-LISP, which embodied such self-knowledge in the domain of metacircular interpreters. Every 3-LISP program is interpreted by a metacircular interpreter, also written in 3-LISP. This gives rise to a picture of an infinite tower of metacircular interpreters, each being interpreted by the one above it. Such a metaphor poses a serious challenge for conventional modes of understanding of programming languages. In our earlier work on reflection [4], we showed how a useful species of reflection could be modeled without the use of towers. In this paper, we give a semantic account of the reflective tower. This account is self-contained in the sense that it does not employ reflection to explain reflection.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01806174
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Expansion-passing style: A general macro mechanism (1988)
    Springer
    Higher-order and symbolic computation 1 (1988), S. 53-75 
    Details
    ISSN: 1573-0557
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The traditional Lisp macro expansion facility inhibits several important forms of expansion control. These include selective expansion of subexpressions, expansion of subexpressions using modified expansion functions, and expansion of application and variable expressions. Furthermore, the expansion algorithm must treat every special form as a separate case. The result is limited expressive power and poor modularity. We propose an alternative facility that avoids these problems, using a technique calledexpansion-passing style (EPS). The critical difference between the facility proposed here and the traditional macro mechanism is that expansion functions are passed not only an expression to be expanded but also another expansion function. This function may or may not be used to perform further expansion. The power of this technique is illustrated with several examples. Most Lisp systems may be adapted to employ this technique.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01806176
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    First-class extents (1993)
    Springer
    Higher-order and symbolic computation 5 (1993), S. 343-375 
    Details
    ISSN: 1573-0557
    Keywords: Identifier ; Variable ; Location ; Scope ; Extent ; State
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Adding environments as first-class entities to a language can greatly enhance its expressiveness. But first-class environments rely on identifiers, the syntax of variables, and thus do not mesh well with lexically-scoped languages. We present first-class extents as an alternative. First-class extents are founded upon lexical variables with dynamic extent. They are defined directly on the variables themselves rather than on their syntax. They therefore do not cause variable name capturing problems that plague first-class environments. Moreover, distinguishing variables from locations allows first-class extents to be orthogonal to imperative and control features.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01806310
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    A simple reflective interpreter (1996)
    Springer
    Higher-order and symbolic computation 9 (1996), S. 181-202 
    Details
    ISSN: 1573-0557
    Keywords: reflection ; interpreter ; Lisp
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Procedurally reflective programming languages enable user programs to semantically extend the language itself, by permitting them to run at the level of the language implementation with access to their context. The reflective tower, first introduced by Brian Smith, is the principal architecture for such languages. It is informally described as an infinitely ascending tower of metacircular interpreters, connected by a mechanism that allows programs at one level to run at the next higher level. Various accounts of the reflective tower have been published, including a metacircular definition, operational definitions, and denotational definitions. We present an operational account of the main aspects of the reflective tower, which we claim is simpler than previous accounts. Our approach is to implement a finite tower where each level literally runs the level directly below it. A complete Scheme implementation is included.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01806112
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    facet.materialart.
    Unknown
    Unbounded computational structures (1978)
    Wiley
    Details
    Publication Date: 1978-07-01
    Print ISSN: 0038-0644
    Electronic ISSN: 1097-024X
    Topics: Computer Science
    Published by Wiley
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 9
    facet.materialart.
    Unknown
    Aspect-Oriented Programming is Quantification and Obliviousness (2000)
    In:  CASI
    Details
    Publication Date: 2013-08-29
    Description: This paper proposes that the distinguishing characteristic of Aspect-Oriented Programming (AOP) systems is that they allow programming by making quantified programmatic assertions over programs written by programmers oblivious to such assertions. Thus, AOP systems can be analyzed with respect to three critical dimensions: the kinds of quantifications allowed, the nature of the actions that can be asserted, and the mechanism for combining base-level actions with asserted actions. Consequences of this perspective are the recognition that certain systems are not AOP and that some mechanisms are expressive enough to allow programming an AOP system within them. A corollary is that while AOP can be applied to Object-Oriented Programming, it is an independent concept applicable to other programming styles.
    Keywords: Computer Programming and Software
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 10
    facet.materialart.
    Unknown
    Aspect-Oriented Programming is Quantification and Implicit Invocation (2001)
    In:  CASI
    Details
    Publication Date: 2019-07-13
    Description: We propose that the distinguishing characteristic of Aspect-Oriented Programming (AOP) languages is that they allow programming by making quantified programmatic assertions over programs that lack local notation indicating the invocation of these assertions. This suggests that AOP systems can be analyzed with respect to three critical dimensions: the kinds of quantifications allowed, the nature of the interactions that can be asserted, and the mechanism for combining base-level actions with asserted actions. Consequences of this perspective are the recognition that certain systems are not AOP and that some mechanisms are metabolism: they are sufficiently expressive to allow straightforwardly programming an AOP system within them.
    Keywords: Computer Programming and Software
    Type: Aspects Oriented Software Development; Apr 01, 2002; Twente; Netherlands
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...