Programming with sets. An introduction to SETL. of languages, some of whose other well-known mem­ bers are LISP, APL, SNOBOL, and PROLOG. These languages all aim to reduce the cost of programming, recognized today as a main obstacle to future progress in the computer field, by allowing direct manipulation of large composite objects, considerably more complex than the integers, strings, etc., available in such well-known mainstream languages as PASCAL, PL/I, ALGOL, and Ada. For this purpose, LISP introduces structured lists as data objects, APL introduces vectors and matrices, and SETL introduces the objects characteristic for it, namely general finite sets and maps. The direct availability of these abstract, composite objects, and of powerful mathematical operations upon them, improves programmer speed and pro­ ductivity significantly, and also enhances program clarity and readability. The classroom consequence is that students, freed of some of the burden of petty programming detail, can advance their knowledge of significant algorithms and of broader strategic issues in program development more rapidly than with more conventional programming languages

References in zbMATH (referenced in 26 articles , 1 standard article )

Showing results 1 to 20 of 26.
Sorted by year (citations)

1 2 next

  1. Cristiá, Maximiliano; Rossi, Gianfranco: Automated reasoning with restricted intensional sets (2021)
  2. Cristiá, Maximiliano; Rossi, Gianfranco: An automatically verified prototype of the Tokeneer ID station specification (2021)
  3. Cristiá, Maximiliano; Rossi, Gianfranco: Automated proof of Bell-LaPadula security properties (2021)
  4. Bansal, Kshitij; Barrett, Clark; Reynolds, Andrew; Tinelli, Cesare: Reasoning with finite sets and cardinality constraints in SMT (2018)
  5. Gibbons, Jeremy: Comprehending ringads. For Phil Wadler, on the occasion of his 60th birthday (2016)
  6. Klin, Bartek; Szynwelski, Michał: SMT solving for functional programming over infinite structures (2016)
  7. Cristiá, Maximiliano; Rossi, Gianfranco; Frydman, Claudia: Adding partial functions to constraint logic programming with sets (2015)
  8. Cantone, Domenico; Longo, Cristiano: A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions (2014)
  9. Milanič, Martin; Rizzi, Romeo; Tomescu, Alexandru I.: Set graphs. II. Complexity of set graph recognition and similar problems (2014)
  10. Milanič, Martin; Tomescu, Alexandru I.: Set graphs. IV. Further connections with claw-freeness (2014)
  11. Crouch, Michael; Immerman, Neil; Moss, J. Eliot B.: Finding reductions automatically (2010)
  12. Henglein, Fritz; Larsen, Ken Friis; Simonsen, Jakob Grue; Stefansen, Christian: POETS: process-oriented event-driven transaction systems (2009)
  13. Finkelstein, David Ritz; Castagnoli, Giuseppe: Quantum interference computation (2008)
  14. Gruau, Frédéric; Eisenbeis, Christine; Maignan, Luidnel: The foundation of self-developing blob machines for spatial computing (2008)
  15. Cockshott, Paul; Michaelson, Greg: Orthogonal parallel processing in Vector Pascal (2006)
  16. Goyal, Deepak: Transformational derivation of an improved alias analysis algorithm (2005)
  17. Paige, Robert: An NSF proposal (2005)
  18. Zarba, Calogero G.; Cantone, Domenico; Schwartz, Jacob T.: A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case (2004)
  19. Cantone, Domenico; Ursino, Pietro; Omodeo, Eugenio G.: Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators (2002)
  20. Formisano, Andrea; Omodeo, Eugenio G.; Temperini, Marco: Goals and benchmarks for automated map reasoning (2000)

1 2 next