SBCL: A Sanely-Bootstrappable Common Lisp

Rhodes, Christophe

doi:10.1007/978-3-540-89275-5_5

Cited by 6 publications

(2 citation statements)

References 9 publications

(7 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, due to efficiency issues of the data structures we use, our degree sequences are non-decreasing instead of being non-increasing. We used SBCL version 2.0.11 to run the lisp code [16].…”

Section: A : T Cmentioning

confidence: 99%

Enumerating Labeled Graphs that Realize a Fixed Degree Sequence

Kaygun

2021

Preprint

View full text Add to dashboard Cite

A. A finite non-increasing sequence of positive integers) is called a degree sequence if there is a graph = ( , ) with = { 1 , . . . , } and deg( ) = for = 1, . . . , . In that case we say that the graph realizes the degree sequence . We show that the exact number of labeled graphs that realize a fixed degree sequence satisfies a simple recurrence relation. Using this relation, we then obtain a recursive algorithm for the exact count. We also show that in the case of regular graphs the complexity of our algorithm is better than the complexity of the same enumeration that uses generating functions.

show abstract

Section: A : T Cmentioning

confidence: 99%

Enumerating Labeled Graphs that Realize a Fixed Degree Sequence

Kaygun

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…Within the approaches for bootstrapping reflective languages we can find the Common Lisp bootstrap [Rho08,Str14]. They describe their approach for generating a new virtual machine and image for Lisp: 1.…”

Section: Common Lisp Bootstrapsmentioning

confidence: 99%

A bootstrapping infrastructure to build and extend Pharo-like languages

Polito

Ducasse

Bouraqadi

et al. 2015

2015 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software (Onward!)

View full text Add to dashboard Cite

Bootstrapping is well known in the context of compilers, where a bootstrapped compiler can compile its own source code. Bootstrapping is a beneficial engineering practice because it raises the level of abstraction of a program making it easier to understand, optimize, evolve, etc. Bootstrapping a reflective object-oriented language is however more challenging, as we need also to initialize the runtime of the language with its initial objects and classes besides writing its compiler. In this paper, we present a novel bootstrapping infrastructure for Pharo-like languages that allows us to easily extend and modify such languages. Our bootstrapping process relies on a first-class runtime. A first-class runtime is a meta-object that represents a program's runtime and provides a MOP to easily load code into it and manipulate its objects. It decouples the virtual machine (VM) and language concerns by introducing a clear VM-language interface. Using this process, we show how we succeeded to bootstrap a Smalltalk-based language named Candle and then extend it with traits in less than 250 lines of high-level Smalltalk code. We also show how we can bootstrap with minimal effort two other languages (Pharo and MetaTalk) with similar execution semantics but different object models.

show abstract