Fexprs as the basis of Lisp function application; or, $vau: the ultimate abstraction

Abstraction creates custom programming languages that facilitate programming for specific problem domains. It is traditionally partitioned according to a two-phase model of program evaluation, into syntactic abstraction enacted at translation time, and semantic abstraction enacted at run time. Abstractions pigeon-holed into one phase cannot interact freely with those in the other, since they are required to occur at logically distinct times. Fexprs are a Lisp device that subsumes the capabilities of syntactic abstraction, but is enacted at run-time, thus eliminating the phase barrier between abstractions. Lisps of recent decades have avoided fexprs because of semantic ill-behavedness that accompanied fexprs in the dynamically scoped Lisps of the 1960s and 70s. This dissertation contends that the severe difficulties attendant on fexprs in the past are not essential, and can be overcome by judicious coordination with other elements of language design. In particular, fexprs can form the basis for a simple, well-behaved Scheme-like language, subsuming traditional abstractions without a multi-phase model of evaluation. The thesis is supported by a new Scheme-like language called Kernel, created for this work, in which each Scheme-style procedure consists of a wrapper that induces evaluation of operands, around a fexpr that acts on the resulting arguments. This arrangement enables Kernel to use a simple direct style of selectively evaluating subexpressions, in place of most Lisps\u27 indirect quasiquotation style of selectively suppressing subexpression evaluation. The semantics of Kernel are treated through a new family of formal calculi, introduced here, called vau calculi. Vau calculi use direct subexpression-evaluation style to extend lambda calculus, eliminating a long-standing incompatibility between lambda calculus and fexprs that would otherwise trivialize their equational theories. The impure vau calculi introduce non-functional binding constructs and unconventional forms of substitution. This strategy avoids a difficulty of Felleisen\u27s lambda-v-CS calculus, which modeled impure control and state using a partially non-compatible reduction relation, and therefore only approximated the Church-Rosser and Plotkin\u27s Correspondence Theorems. The strategy here is supported by an abstract class of Regular Substitutive Reduction Systems, generalizing Klop\u27s Regular Combinatory Reduction Systems

Computer Aided Verification

This open access two-volume set LNCS 10980 and 10981 constitutes the refereed proceedings of the 30th International Conference on Computer Aided Verification, CAV 2018, held in Oxford, UK, in July 2018. The 52 full and 13 tool papers presented together with 3 invited papers and 2 tutorials were carefully reviewed and selected from 215 submissions. The papers cover a wide range of topics and techniques, from algorithmic and logical foundations of verification to practical applications in distributed, networked, cyber-physical, and autonomous systems. They are organized in topical sections on model checking, program analysis using polyhedra, synthesis, learning, runtime verification, hybrid and timed systems, tools, probabilistic systems, static analysis, theory and security, SAT, SMT and decisions procedures, concurrency, and CPS, hardware, industrial applications

The Student Handbook of Marshall University, 1985-1986

https://mds.marshall.edu/studenthandbook/1046/thumbnail.jp

Suing Alma Mater

This careful reading of six legal cases in American higher education is an essential primer for understanding contemporary litigation.Winner of the Steven S. Goldberg Award for Distinguished Scholarship in Education Law of the Education Law AssociationAlthough much has been written about U.S. Supreme Court decisions involving higher education, little has been said about the foundational case law and litigation patterns emerging from the lower courts. As universities become increasingly legislated, regulated, and litigious, campuses have become testing grounds for a host of constitutional challenges. From faculty and student free speech to race- or religion-based admissions policies, Suing Alma Mater describes the key issues at play in higher education law.Eminent legal scholar Michael A. Olivas considers higher education litigation in the latter half of the twentieth century and the rise of "purposive organizations,” like the American Civil Liberties Union and the Alliance Defense Fund (now known as the Alliance Defending Freedom), that exist to advance litigation. He reviews more than 120 college cases brought before the Supreme Court in the past fifty years and then discusses six key cases in depth. Suing Alma Mater provides a clear-eyed perspective on the legal issues facing higher education today

Central Washington University 2018-2019 Undergraduate Catalog

https://digitalcommons.cwu.edu/catalogs/1180/thumbnail.jp

Bowdoin Orient v.45, no.1-33 (1915-1916)

https://digitalcommons.bowdoin.edu/bowdoinorient-1910s/1006/thumbnail.jp

The History of Bowdoin College

The History of Bowdoin College (1927), by Louis Clinton Hatch, is the most detailed history of the College for the period from the College’s founding in 1794 until 1927. It is especially useful in documenting College traditions and curricular developments, and tangentially in recording social life in Brunswick.https://digitalcommons.bowdoin.edu/bowdoin-histories/1002/thumbnail.jp

Bowdoin Orient v.119, no.1-25 (1989-1990)

https://digitalcommons.bowdoin.edu/bowdoinorient-1990s/1000/thumbnail.jp

Trinity College Bulletin, 2019-2020

https://digitalrepository.trincoll.edu/bulletin/1669/thumbnail.jp