Skylark (Paul Desmond album)
Skylark is an album by American jazz saxophonist Paul Desmond featuring Gábor Szabó recorded in 1973 and released on the CTI label.[1]
Skylark | ||||
---|---|---|---|---|
Studio album by | ||||
Released | 1974 | |||
Recorded | November 27-28 and December 4, 1973 | |||
Studio | Van Gelder Studio, Englewood Cliffs, NJ | |||
Genre | Cool jazz, bossa nova | |||
Length | 53:28 Reissue with bonus tracks | |||
Label | CTI CTI 6039 | |||
Producer | Creed Taylor | |||
Paul Desmond chronology | ||||
|
Reception
The Allmusic review by Richard S. Ginell awarded the album 3 stars and stated "Paul Desmond injects a bit of the 1970s into his sound, obtaining agreeable if not totally simpatico results... It's a cautious change of pace for Desmond, although the fiercer context into which he was placed doesn't really fire his imagination".[2]
Review scores | |
---|---|
Source | Rating |
Allmusic | |
The Penguin Guide to Jazz |
Track listing
- "Take Ten" (Paul Desmond) - 6:08
- "Romance de Amor" (Traditional) - 9:40
- "Was a Sunny Day" (Paul Simon) - 4:52
- "Music for a While" (Henry Purcell) - 6:45
- "Skylark" (Hoagy Carmichael, Johnny Mercer) - 5:21
- "Indian Summer" (Al Dubin, Victor Herbert) - 4:00
- "Music for a While" [alternate take] (Purcell) - 5:56 Bonus track on CD reissue
- "Skylark" [alternate take] (Carmichael, Mercer) - 5:39 Bonus track on CD reissue
- "Indian Summer" [alternate take] (Dubin, Herbert) - 5:27 Bonus track on CD reissue
- Recorded at Van Gelder Studio in Englewood Cliffs, New Jersey on November 27-28 and December 4, 1973
Personnel
From the original liner notes.[4]
- Paul Desmond - alto saxophone
- Bob James - piano, electric piano
- Gene Bertoncini - guitar
- Gábor Szabó - guitar (all solos)
- Ron Carter - bass
- Jack DeJohnette - drums
- Ralph MacDonald - percussion
- George Ricci - cello
- Don Sebesky - arranger
- Rudy Van Gelder - recording engineer
gollark: Please also give me write access to the repo.
gollark: Oh, right, array indexing.
gollark: ```python# parsita-based pseudocode syntax parserfrom stmt import *from parsita import *from parsita.util import constantdef compose(f, g): return lambda x: f(g(x))def map_expr(x): start, end = x if end == "": return start return Op([start, end[1]], end[0])def map_unop_expr(x): return Op(x[1], x[0])def aliases(name, aliases): p = lit(name) for alias in aliases: p |= (lit(alias) > (lambda _: name)) return pclass ExprParser(TextParsers): ε = lit("") IntLit = reg("\-?[0-9]+") > compose(IntLit, int) StrLit = "'" >> reg("[^']*") << "'" > StrLit # TODO escapes (not in "spec" but could be needed) FloatLit = reg("\-?[0-9]+\.[0-9]+") > compose(FloatLit, float) Identifier = reg("[a-zA-Z_]+[a-zA-Z_0-9]*") > Var BracketedExpr = "(" >> Expr << ")" UnaryOperator = lit("NOT") Start = FloatLit | StrLit | IntLit | BracketedExpr | (UnaryOperator & Expr > map_unop_expr) | Identifier # avoid left recursion problems by not doing left recursion # AQA pseudocode does not appear to have a notion of "operator precedence", simplifying parsing logic nicely BinaryOperator = aliases("≤", ["<="]) | aliases("≠", ["!="]) | aliases("≥", [">="]) | lit("DIV") | lit("MOD") | lit("AND") | lit("OR") | reg("[+/*\-=<>]") End = (BinaryOperator & Expr) | ε Expr = (Start & End) > map_exprparse = ExprParser.Expr.parsex = parse("1+2+3 != 6 AND NOT 4 AND x + y")if isinstance(x, Failure): print(x.message)else: print(x.value)```
gollark: <@332271551481118732> Expression parsing is done, I think.
gollark: I wonder if AQA pseudocode *does* have operator precedence. We may need to harvest exam papers.
References
- CTI Records discography accessed February 10, 2012
- Ginell, R. S. Allmusic Review accessed February 10, 2012
- Cook, Richard; Brian Morton (2004). The Penguin Guide to Jazz on CD. The Penguin Guide to Jazz (7th ed.). London: Penguin. ISBN 9780141014166.
- Skylark (Liner notes). Paul Desmond. New York City: CTI Records. 1974. CTI 6039.CS1 maint: others (link)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.