Fired Up (Dan Seals album)
Fired Up is a studio album released by country music artist Dan Seals. It was released in 1994 under the Warner Bros. label. It produced two unsuccessful singles. The song, "Gentleman of Leisure" was written by Folk Rock musician, Jesse Winchester who would later record it for his 1999 album of the same name.
Fired Up | ||||
---|---|---|---|---|
Studio album by | ||||
Released | August 16, 1994 | |||
Genre | Country | |||
Length | 35:45 | |||
Label | Warner Bros. | |||
Producer | Jerry Crutchfield | |||
Dan Seals chronology | ||||
|
Review scores | |
---|---|
Source | Rating |
Allmusic |
Track listing
- "All Fired Up" (Dennis Morgan, Steve Davis, Bobby Lee Springfield) - 2:35
- "Love Thing" (Michael Jordan, Jim Weatherly) - 3:51
- "A Rose from Another Garden" (Joe Doyle, Glen Davies) - 3:10
- "Hillbilly Fever" (Doyle, Todd Wilkes) - 3:01
- "When" (Robert Ellis Orrall, Giles Goddard) - 3:26
- "Call Me Up" (Josh Leo, Harry Stinson) - 3:13
- "Jayney" (Johnny Nestor) - 3:23
- "A Good Place to Be" (Rory Michael Bourke, Charlie Black) - 3:33
- "Gentleman of Leisure" (Jesse Winchester) - 4:13
- "Still Reelin' (From Those Rock & Roll Days)" (Dan Seals, Allen Shamblin) - 5:23
Singles
Year | Single | US Country |
---|---|---|
1994 | "All Fired Up" | 66 |
"Love Thing" | - |
gollark: Writing a bare metal microkernel in Haskell is not very practical.
gollark: > I never tried it. It's nice that it has these safety features but I prefer C++ still. > If I want to be sure that my program is free of bugs, I can write a formal specification and do a > correctness proof with the hoare calculus in some theorem proofer (People did that for the seL4 microkernel, which is free from bugs under some assumptions and used in satellites, nuclear power plants and such)Didn't doing that for seL4 require several hundred thousand lines of proof code?
gollark: Most countries have insanely convoluted tax law so I assume it's possible.
gollark: Hmm, so you need to obtain a hypercomputer of some sort to write your tax forms such that they cannot plausibly be checked?
gollark: What if it's somehow really easy to find *a* solution to something, but not specific ones, and hard to check the validity of a specific maybe-solution? Is that possible?
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.