To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
The art of music is no longer limited to the sounding models of instruments and voices. Electoacoustic music opens access to all sounds, a bewildering sonic array ranging from the real to the surreal and beyond. For listeners the traditional links with physical sound-making are frequently ruptured: electroacoustic sound-shapes and qualities frequently do not indicate known sources and causes. Gone are the familiar articulations of instruments and vocal utterance: gone is the stability of note and interval: gone too is the reference of beat and metre. Composers also have problems: how to cut an aesthetic path and discover a stability in a wide-open sound world, how to develop appropriate sound-making methods, how to select technologies and software.
This article may be considered the outline of an ongoing study of different types of structural concepts, and their referential or non-referential content, in electroacoustic, computer and mixed music composed mostly in French electroacoustic music studios (GRM, IRCAM, UPIC, GMEM, etc.). This analytical study began in Hungary in 1988, in the course of a broadcast series on certain chapters of the history of electroacoustic music.This work has been supported in Hungary by the Soros Foundation.The study later investigated narrativity in electroacoustic music,In the form of a paper presented at the 2nd International Symposium on Musical Signification (Helsinki, 1988), published in French, in the No. 51 issue of MUSICWORKS Magazine, and in the Acts of the Symposium published in English, in 1995: ‘Narrativity and electroacoustic music’, in Musical signification, E. Tarasti, ed., Mouton de Gruyter, Berlin and New York.and then incorporated a more complex typology embracing formal, structural approaches in about thirty characteristic works composed since the 1970s. Work on these selected pieces offers a range of investigations into their structure, from the assumption of the oldest structural concepts through to very recent ideas.Plan of a book, some chapters of which were drafted in France, from 1990 onwards, thanks to a grant awarded to CIREM by the Direction de la Musique du Ministère de la Culture, with a view to publishing works on electroacoustic music.
Assuming that perception works as a constant dialectic between sense-data and concept, this paper presents a perceptual analysis of J. C. Risset‘s Sud according to a conceptual framework based on a complementarity between intrinsic and extrinsic connotations in electroacoustic music. From this perspective, Sud may be perceived as an encounter between human imagination and nature in two of its most powerful symbols: the sea, alluded to through the sounds of the waves, and the forest, alluded to through the sounds of birds and insects. The piece presents an exploration of the essence of these environmental sounds, which are either modified or recreated with different substances. In its appeal to images widespread in a variety of cultures, as well as in its unique use of traditional musical materials, Sud is more than a strongly programmatic and visually evocative piece.
For a finite set D of nodes let E2(D)={(x, y)[mid ]x, y∈D, x≠y}. We define an inversive Δ2-structure g as a function g[ratio ]E2(D)→Δ into a given group Δ satisfying the property g(x, y)=g(y, x)−1 for all (x, y)∈E2(D). For each function (selector) σ[ratio ]D→Δ there is a corresponding inversive Δ2-structure gσ defined by gσ(x, y)=σ(x)·g(x, y)·σ(y)−1. A function η mapping each g into the group Δ is called an invariant if η(gσ)=η(g) for all g and σ. We study the group of free invariants η of inversive Δ2-structures, where η is defined by a word from the free monoid with involution generated by the set E2(D). In particular, if Δ is abelian, the group of free invariants is generated by triangle words of the form (x0, x1)(x1, x2)(x2, x0).
This paper explores the relationship between how we use and theorise frequency as musicians and how frequency is perceived by listeners within the technological and ideological context of electroacoustic music. With reference to work in perception, music theory and aesthetics, it is argued that thinking about frequency is still dominated by the idea of music’s abstract significance. It is suggested that although electroacoustic music presents a challenge to such ideology, this challenge is not reflected in current musical research, leading to a peculiar dislocation between practice and theory. In conclusion, it is proposed that studying the ways in which frequency structure contributes to meaning might provide a better understanding of the production and perception of electroacoustic music than studying frequency structure in itself.
Place/transition (PT) Petri nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the ‘token game’ is too intensional, even in its more abstract interpretations in terms of nonsequential processes and monoidal categories; on the other hand, Winskel's basic unfolding construction, which provides a coreflection between nets and finitary prime algebraic domains, works only for safe nets. In this paper we extend Winskel's result to PT nets. We start with a rather general category PTNets of PT nets, we introduce a category DecOcc of decorated (nondeterministic) occurrence nets and we define adjunctions between PTNets and DecOcc and between DecOcc and Occ, the category of occurrence nets. The role of DecOcc is to provide natural unfoldings for PT nets, i.e., acyclic safe nets where a notion of family is used to relate multiple instances of the same place. The unfolding functor from PTNets to Occ reduces to Winskel's when restricted to safe nets. Moreover, the standard coreflection between Occ and Dom, the category of finitary prime algebraic domains, when composed with the unfolding functor above, determines a chain of adjunctions between PTNets and Dom.
Pitch and loudness are subjective aspects of sound which can be described in terms of the observed abilities of subjects to rate them on a scale from ‘low’ to ‘high’. Timbre is a subjective aspect of sound for which there is no such scale and neither qualitative nor quantitative descriptions are generally found that are widely accepted. The purpose of this paper is to shed light on some frequency domain aspects of the nature of timbre by making use of the results obtained from an analysis system which is designed to take advantage of contemporary psychoacoustical knowledge relating to human peripheral hearing. Results are presented which illustrate the relationship between contemporary psychoacoustic ideas relating to timbre and ideas first discussed by Helmholtz and later taken up by other researchers. Analyses by the system of a selection of sounds from acoustic musical instruments with clear timbral differences are also presented in order to place these discussions in a musical context.
To a practising composer the term 'frequency domain' must refer primarily to the ways s/he organises pitch material. Additionally, to the experienced electroacoustic composer, it will refer to the treatment of the spectral content of sounds used, which may or may not be a conscious act within the compositional process.
We investigate Girard's calculus Fω as a ‘Curry style’ type assignment system for pure lambda terms. First we show an example of a strongly normalizable term that is untypable in Fω. Then we prove that every partial recursive function is nonuniformly represented in Fω (even if quantification is restricted to constructor variables of level 1). It follows that the type reconstruction problem is undecidable and cannot be recursively separated from normalization.
This book is not about type theories in general but about one very neat and special system called “TA” for “type-assignment”. Its types contain type-variables and arrows but nothing else, and its terms are built by λ-abstraction and application from term-variables and nothing else. Its expressive power is close to that of the system called simple type theory that originated with Alonzo Church.
TA is polymorphic in the sense that a term can have more than one type, indeed an infinite number of types. On the other hand the system has no ∀-types and hence it is weaker than the strong polymorphic theories in current use in logic and programming. However, it lies at the core of nearly every one of them and its properties are so distinctive and even enjoyable that I believe the system is worth isolating and studying on its own. That is the aim of this book. In it I hope to try to pass on to the reader the pleasure the system's properties have given me.
TA is also an excellent training ground for learning the techniques of type-theory as a whole. Its methods and algorithms are not trivial but the main lines of most of them become clear once the basic concepts have been understood. Many ideas that are complicated and tedious to formulate for stronger type-theories, and many complex techniques for analysing structures in these theories, appear in TA in a very clean and neat stripped-down form.
One of the most interesting facts about TAλ is that there is a very close correspondence between this system and propositional logic, in which the types assignable to closed terms in TAλ turn out to be exactly the formulae provable in a certain formal logic of implication. This correspondence is often called the Curry-Howard isomorphism or the formulae-as-types isomorphism, and will be studied in this chapter.
The logic involved in this correspondence is not the classical logic of truth-tables however, but that of the intuitionist philosophers; it will be defined in the first section below.
The Curry-Howard isomorphism was first hinted at in print in Curry 1934 p.588, and was made explicit in Curry 1942 p.60 footnote 28 and Curry and Feys 1958 §9E. But it was viewed there as no more than a curiosity. The first people to see that it could be extended to other connectives and quantifiers and used as a technical tool to derive results were N. G. de Bruijn, William Howard and H. Läuchli in the 1960's. See Howard 1969, de Bruijn 1980 (an introduction to de Bruijn's AUTOMATH project which began in the 1960's), and Läuchli 1965.
This chapter will also define three rather interesting subsystems of intuitionist logic and show that they correspond to the three restricted classes of λ-terms defined in Section ID. This correspondence was first noted by Carew Meredith in unpublished work around 1951 and was explored in detail in the thesis Rezus 1981.
The λ-calculus is a family of prototype programming languages invented by a logician, Alonzo Church, in the 1930's. Their main feature is that they are higherorder; that is, they give a systematic notation for operators whose input and output values may be other operators. Also they are functional, that is they are based on the notion of function or operator and include notation for function-application and abstraction.
This book will be about the simplest of these languages, the pure λ-calculus, in which λ-terms are formed by application and abstraction from variables only. No atomic constants will be allowed.
λ-terms and their structure
Definition (λ-terms) An infinite sequence of term-variables is assumed to be given. Then linguistic expressions called λ--terms are defined thus:
each term-variable is a λ-term, called an atom or atomic term;
if M and N are λ-terms then (MN) is a λ-term called an application;
if x is a term-variable and M is a λ-term then (λx. M) is a λ-term called an abstract or a λ-abstract.
A composite λ-term is a λ-term that is not an atom.
Notation Term-variables are denoted by “u”, “v”, “w”, “x”, “y”, “z”, with or without number-subscripts. Distinct letters denote distinct variables unless otherwise stated.
Arbitrary λ-terms are denoted by “L”, “M”, “N”, “P”, “Q”, “R”, “S”, “T”, with or without number-subscripts. For “λ-term” we shall usually say just “term”.
The topic of this book is one of the simplest current type-theories. It was called TA in the Introduction but in fact it comes in two forms, TAc for combinatory logic and TAλ for λ-calculus. Since most readers probably know λ-calculus better than combinatory logic, only TAλ will be described here. (The reader who wishes to see an outline of TAC can find one in HS 86 Ch.14; most of its properties are parallel to those of TAλ.)
The present chapter consists of a definition and description of TAλ. It is close to the treatment in HS 86 Ch. 15 but differs in some technical details.
The system TAλ
Definition (Types) An infinite sequence of type-variables is assumed to be given, distinct from the term-variables. Types are linguistic expressions defined thus:
each type-variable is a type (called an atom);
if σ and τ are types then (σ→τ) is a type (called a composite type).
NotationType-variables are denoted by “a”, “b”, “c”, “d”, “e”, “f”, “g”, with or without number-subscripts, and distinct letters denote distinct variables unless otherwise stated.
Arbitrary types are denoted by lower-case Greek letters except “λ”.
Parentheses will often (but not always) be omitted from types, and the reader should restore omitted ones in such a way that, for example,
ρ→σ→τ ≡ (ρ→(σ→τ)).
This restoration rule is called association to the right.
Informal interpretation To interpret types we think of each type-variable as a set and σ→τ as a set of functions from σ into τ.
In Chapter 2 some care was taken to distinguish the Curry and Church approaches to type-theory from each other. Curry's approach involved assigning types to preexisting untyped terms with each term receiving either an infinite set of types or none at all, whereas in Church's the terms were defined with built-in types with each term having a single type (see 2A3). In Curry's approach the types contained variables, in Church's they contained only constants.
This book focuses on the Curry approach. However, even in this approach it turns out to be very useful to introduce a typed-term language as an alternative notation for TAλ-deductions. Although the tree-notation introduced in Chapter 2 shows very clearly what assumptions are needed in deducing what conclusions, it takes up a lot of space and is hard to visualise when the deduction is in any way complicated. And when manipulations and reductions of deductions are under discussion it is almost unmanageable. A much more compact alternative notation is needed, and this is what the typed terms in the present chapter will give.
We shall also define reduction of typed terms; typed terms will be shown in the next chapter to encode deductions in propositional logic as well as in TAλ, and their reduction will be essentially the same as the reduction of deductions that is a standard tool in proof theory.