Last update: Sat Jan 6 02:03:49 MST 2018
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Bird:1989:AIP,
author = "R. S. Bird",
title = "Algebraic Identities for Program Calculation",
journal = j-COMP-J,
volume = "32",
number = "2",
pages = "122--126",
month = apr,
year = "1989",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/32.2.122",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
MRclass = "68N05",
MRnumber = "990 780",
bibdate = "Tue Dec 4 14:48:26 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/32/2.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/;
Misc/Functional.bib",
URL = "http://comjnl.oxfordjournals.org/content/32/2/122.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/122.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/123.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/124.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/125.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/126.tif",
abstract = "There is a style of functional programming which
focuses attention on a small collection of powerful
higher-order functions that capture common patterns of
computation. The idea is to try and express programs in
terms of the composition of particular instances of
these useful functions. Explicit use of recursion is
therefore avoided, except as a last resort. A similar,
indeed dual, style can be advocated when it comes to
program proof. The idea here is to try and conduct
proofs through equational reasoning that exploits the
algebraic properties of the collection of higher-order
functions. Explicit use of induction is therefore
avoided.",
acknowledgement = ack-nhfb,
affiliation = "Oxford Univ.",
affiliationaddress = "Oxford, Engl",
classcodes = "C6110 (Systems analysis and programming)",
classification = "723; C6110 (Systems analysis and programming)",
corpsource = "Oxford Univ., UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "algebra; algebraic; Algebraic identities; Algebraic
Identities; Computer Metatheory--Programming Theory;
Equational reasoning; Equational Reasoning; equational
reasoning; Functional Programming; functional
programming; Functional programming, Computer
Programming; Higher-order functions; higher-order
functions; identities; Program calculation; Program
Calculation; program calculation; Theory",
thesaurus = "Algebra; Functional programming",
treatment = "P Practical",
}
Related entries
- 68N05,
27(4)340,
30(1)27,
30(4)378,
30(5)437,
30(6)507,
31(1)17,
31(3)229
- algebra,
23(1)73,
25(1)56,
25(2)231,
25(3)397,
25(4)493,
26(1)6,
26(2)184,
27(2)159,
28(2)142,
28(3)340,
29(3)261,
29(5)416,
30(3)268,
30(6)498,
31(1)34,
31(3)229,
31(4)313,
31(6)564,
31(6)567
- algebraic,
27(2)178,
27(4)301,
28(1)59,
28(2)142,
28(2)154,
29(3)261,
29(5)416,
30(4)316,
31(3)229,
31(4)313,
32(5)413
- C6110,
31(5)391,
31(5)420,
31(5)426,
31(5)431,
31(6)481,
31(6)531,
31(6)545,
32(1)1,
32(2)98,
32(2)142,
32(2)152,
32(2)175,
32(3)202,
32(4)290,
32(4)305,
32(4)323,
32(4)333,
32(4)341,
32(5)461
- calculation,
28(3)343,
30(2)110,
30(3)276-2,
31(6)561
- collection,
24(1)71,
29(1)76,
30(2)119
- common,
27(4)301,
28(4)414,
29(2)167
- computation,
23(1)34,
25(4)471,
26(4)293,
27(3)201,
28(1)9,
28(4)375,
29(2)103,
29(6)553,
30(1)87,
30(5)433,
31(6)567,
32(4)297
- dual,
23(2)165
- except,
30(5)437,
31(4)289
- explicit,
25(2)235,
26(2)188,
26(2)188-1,
27(1)27,
30(4)289
- function,
23(2)165,
23(3)286,
24(1)42,
25(3)379,
25(3)397,
25(4)448,
28(1)54,
29(1)9,
29(1)38,
29(3)277,
29(4)289,
30(1)27,
31(1)17,
31(3)209,
31(3)229,
31(3)243,
31(6)510,
32(1)36,
32(1)93,
32(2)98,
32(4)305,
32(5)461
- higher-order,
31(6)517,
32(2)98
- idea,
29(4)289
- identity,
31(6)503
- induction,
25(1)105
- instance,
28(2)154,
28(4)357
- last,
32(2)152
- Metatheory--Programming,
31(6)517,
32(4)290,
32(4)305,
32(4)323
- order, Higher-,
31(6)517,
32(2)98
- order, higher-,
31(6)517,
32(2)98
- particular,
30(5)437,
31(4)289,
32(2)98,
32(2)162,
32(2)175
- pattern,
23(1)46,
24(3)263,
25(1)37,
25(1)116,
25(1)130,
26(4)375,
27(4)362,
28(1)82,
28(3)264,
28(4)409,
28(5)538,
30(4)349,
30(5)420,
31(4)344,
32(2)127,
32(4)351,
32(6)549
- Programming, Metatheory-,
31(6)517,
32(4)290,
32(4)305,
32(4)323
- proof,
27(3)230,
28(5)474,
29(1)17,
29(5)404,
29(6)531,
30(4)376,
30(6)507,
31(4)289
- property,
25(4)471,
28(3)298,
28(4)406,
28(4)439,
29(5)404,
30(1)27,
31(1)25,
31(4)325,
31(6)564,
32(5)437,
32(5)445
- reasoning,
26(2)154
- recursion,
29(6)531,
31(6)531,
32(4)305
- similar,
30(5)437
- small,
25(3)396,
30(3)239,
30(4)295,
30(4)343,
30(5)437,
32(2)142,
32(6)533
- style,
24(2)143,
25(2)176,
28(2)134
- term,
26(3)239,
29(2)171,
32(3)212,
32(5)422
- there,
30(5)437,
31(4)289,
32(2)162
- through,
23(1)61,
23(2)146-1,
24(1)71,
26(2)134,
27(3)270,
29(4)330,
31(4)296
- use,
23(2)107,
24(1)95,
25(2)218,
26(1)93,
26(3)235,
28(2)162,
28(3)203,
29(1)52,
29(2)167,
29(4)289,
29(5)430,
30(1)80,
30(3)214,
30(4)362,
30(5)437,
30(5)451,
31(3)243,
31(4)289,
31(5)420,
32(2)152,
32(4)333,
z(z)z
- useful,
27(1)57,
28(3)203
- when,
31(6)496,
32(1)13,
32(2)142
- which,
23(2)142,
24(4)320,
29(3)201,
30(3)214,
30(5)437,
31(3)243,
31(4)289,
31(4)296,
32(1)13,
32(1)45,
32(1)93,
32(2)108,
32(2)142,
32(2)162,
32(5)461