ProgramaÃ§Ã£o Funcional e Concorrente com Scheme

More documents

Recommendations

Info

notas de aula - Jerônimo C. Pellegrini 0-13-674409-5. 49 WELCH, P. H. Process oriented design for java: Concurrency for all. In: P.M.A.SLOOT et al. (Ed.). Proceedings of Computational Science - ICCS 2002. [S.l.]: Springer-Verlag, 2002. p. 687–687. Keynote Tutorial. 50 ERICSSON-ZENITH. Occam 2 Reference Manual. [S.l.]: Prentice-Hall, 1988. ISBN 0-13-629312-3. 51 BARNES, F.; WELCH, P. occam-pi: blending the best of CSP and the pi-calculus. 2006. http://www.cs.kent.ac.uk/projects/ofa/kroc/, acessado em 10/07/2010. 52 HEWITT, C.; BISHOP, P.; STEIGER, R. A universal modular ACTOR formalism for artificial intelligence. In: Proceedings of the International Joint Conference on Artificial Intelligence. [S.l.: s.n.], 1973. p. 235–245. 53 CLINGER, W. Foundations of Actor Semantics. Tese (Doutorado) — Massachussets Institute of Technology, 1981. 54 ARMSTRONG, J. Programming Erlang. [S.l.]: Pragmatic Bookshelf, 2007. 55 CESARINI, F. Erlang Programming. [S.l.]: O’Reilly, 2009. 56 POLLAK, D. Beginning Scala. [S.l.]: Apress, 2009. 57 WAMPLER, D. Programming Scala. [S.l.]: O’Reilly Media, 2008. 58 SUBRAMANIAM, V. Programming Scala: Tackle Multi-Core Complexity on the Java Virtual Machine. [S.l.]: Pragmatic B, 2009. 59 WAMPLER, A. P. D. Programming Scala: Scalability = Functional Programming + Objects. [S.l.]: O’Reilly, 2009. 60 GERMAIN, G.; FEELEY, M.; MONNIER, S. Concurrency oriented programming in termite scheme. In: Proceedings of the Scheme and Functional Programming Workshop (SFPW’06). [S.l.: s.n.], 2006. p. 125–135. 61 IEEE. Portable Operating System Interface (POSIX). [S.l.]: IEEE, 2003. Versão Preliminar 344 [ 27 de outubro de 2010 at 15:47 ]
notas de aula - Jerônimo C. Pellegrini Í N D I C E R E M I S S I VO *, 323 +, 323 -, 323 /, 324 =, 324 ambiente, 83 angle, 49 arcocosseno, 324 arcosseno, 324 arcotangente, 324 arquivo, 61 assoc, 46 assq, 48 assv, 48 avaliação preguiçosa, 215 barreira, 252 call-with-current-continuation, 198 call/cc, veja call-with-current-continuation char-alphabetic, 44 char->integer, 42 char-upcase, 42 cifra de César, 42 close-input-port, 61 close-output-port, 61 co-rotinas, 207 communicating sequential processes, 279 complex, 49 comportamento de um ator, 289 composição de funções, 35 cond, 19 condição de corrida, 228 condições, 17 condition-variable-signal, 241 condition-variable, 241 contexto de uma computação, 196 continuação, 195 controle construção sintática de estruturas, 176 corretude de programas, 37 prova de, 39 cosseno, 324 CSP, veja communicating sequential processes current-input-port, 62 current-output-port, 62 Currying, 36 deadlock, 230 define-macro, 162 define-structure, 187 define-syntax, 169 delay, 215 denominador de número racional, 324 Versão Preliminar display, 62 do, 98 drop, 130 [ 27 de outubro de 2010 at 15:47 ] 345
Page 1 and 2:
notas de aula - Jerônimo C. Pelleg
Page 3 and 4:
Page 5 and 6:
Page 7 and 8:
Page 9 and 10:
Page 11 and 12:
Page 13 and 14:
Page 15 and 16:
Page 17 and 18:
Page 19 and 20:
Page 21 and 22:
Page 23 and 24:
Page 25 and 26:
Page 27 and 28:
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
Page 35 and 36:
Page 37 and 38:
Page 39 and 40:
Page 41 and 42:
Page 43 and 44:
Page 45 and 46:
Page 47 and 48:
Page 49 and 50:
Page 51 and 52:
Page 53 and 54:
Page 55 and 56:
Page 57 and 58:
Page 59 and 60:
Page 61 and 62:
Page 63 and 64:
Page 65 and 66:
Page 67 and 68:
Page 69 and 70:
Page 71 and 72:
Page 73 and 74:
Page 75 and 76:
Page 77 and 78:
Page 79 and 80:
Page 81 and 82:
Page 83 and 84:
Page 85 and 86:
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100:
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
Page 107 and 108:
Page 109 and 110:
Page 111 and 112:
Page 113 and 114:
Page 115 and 116:
Page 117 and 118:
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
Page 125 and 126:
Page 127 and 128:
Page 129 and 130:
Page 131 and 132:
Page 133 and 134:
Page 135 and 136:
Page 137 and 138:
Page 139 and 140:
Page 141 and 142:
Page 143 and 144:
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
Page 151 and 152:
Page 153 and 154:
Page 155 and 156:
Page 157 and 158:
Page 159 and 160:
Page 161 and 162:
Page 163 and 164:
Page 165 and 166:
Page 167 and 168:
Page 169 and 170:
Page 171 and 172:
Page 173 and 174:
Page 175 and 176:
Page 177 and 178:
Page 179 and 180:
Page 181 and 182:
Page 183 and 184:
Page 185 and 186:
Page 187 and 188:
Page 189 and 190:
Page 191 and 192:
Page 193 and 194:
Page 195 and 196:
Page 197 and 198:
Page 199 and 200:
Page 201 and 202:
Page 203 and 204:
Page 205 and 206:
Page 207 and 208:
Page 209 and 210:
Page 211 and 212:
Page 213 and 214:
Page 215 and 216:
Page 217 and 218:
Page 219 and 220:
Page 221 and 222:
Page 223 and 224:
Page 225 and 226:
Page 227 and 228:
Page 229 and 230:
Page 231 and 232:
Page 233 and 234:
Page 235 and 236:
Page 237 and 238:
Page 239 and 240:
Page 241 and 242:
Page 243 and 244:
Page 245 and 246:
Page 247 and 248:
Page 249 and 250:
Page 251 and 252:
Page 253 and 254:
Page 255 and 256:
Page 257 and 258:
Page 259 and 260:
Page 261 and 262:
Page 263 and 264:
Page 265 and 266:
Page 267 and 268:
Page 269 and 270:
Page 271 and 272:
Page 273 and 274:
Page 275 and 276:
Page 277 and 278:
Page 279 and 280:
Page 281 and 282:
Page 283 and 284:
Page 285 and 286:
Page 287 and 288:
Page 289 and 290:
Page 291 and 292:
Page 293 and 294:
Page 295 and 296:
Page 297 and 298:
Page 299 and 300:
Page 301 and 302: notas de aula - Jerônimo C. Pelleg
Page 351: notas de aula - Jerônimo C. Pelleg
show all

ProgramaÃ§Ã£o Funcional e Concorrente com Scheme

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?