[encoding24]
Markus Lepper and Baltasar Trancón y Widemann
Critical Semantic Properties of Music Notation Datasets
in: Music encoding Conference 2024,
Denton, TX, 2024
[.22002 document]
Here is
the complete talk (reconstructed)
.
|
[feldman24]
Markus Lepper and Baltasar Trancón y Widemann
Morton Feldman's ``Projections One to Five''
--- Exploring a Classical Avant-Garde Notation
by Mathematical Remodelling
in: Proceedings of the Tenor 2024 Conference,
Zürich, 2024
[.pdf document]
Here is
the complete talk (reconstructed)
.
|
[revHonnef21]
Baltasar Trancón y Widemann and Markus Lepper
Revision Control Revised --- Some Contributions to the Algebraic Theory of Patches
in: Tagungsband der Jahrestreffen 2021–2023 der
GI-Fachgruppe „Programmiersprachen und Rechenkonzepte,
Duale Hochschule Baden-Württemberg, Stuttgart, 2024
[.pdf document]
|
[teimec_d2d_23]
Markus Lepper and Baltasar Trancón y Widemann
Talk on d2d principles on the "econding cultures" joiint tei-mec-conference
(publication pending)(edts.)
Paderborn, 2023
the complete talk (reconstructed)
.
|
[beams23]
Markus Lepper and Baltasar Trancón y Widemann
Beam it up! --- A Classification Grid for Historic and Contemporary
Practices of Beaming by Mathematical Re-Modelling
in: Proceedings of the Tenor 2023 Conference,
boston, 2023
[.org/record/8079306 document]
Here are
the slides
and a funny
introductory video
and
the complete talk (reconstructed)
.
|
[ramics23]
Baltasar Trancón y Widemann and Markus Lepper
Towards a Theory of Conversion Relations for Prefixed Units of Measure
in: 20th International Conference on
Relational and Algebraic Methods in Computer Science,
Springer LNCS 13896, Heidelberg, New Yorik, 2023
[.11580 document]
|
[evcs23]
Markus Lepper and Baltasar Trancón y Widemann
Visitor Optimization Revisited
in: Proceedings of the Eelco Visser Commemorative Symposium EVCS 2023,
delft, 2023
[.php?semnr=16272 document]
|
[funcode23]
Baltasar Trancón y Widemann and Markus Lepper and Michael Oehler
Modulation Mining---Computer-Aided Exploration of Functional Chord Forms
in: Music & Science, Thousand Oaks, CA, 2022
[.1177/20592043221149928 document]
Hier die
Folien eines Vortrages
vor Studenten in Osnabrück
|
[worat22]
Lepper, Markus
Wege zum Weihnachtsoratorium
Rekonstruktionen im Mittelgrund
epOs, Osnabrück, 2022
[.html?id=183-Dokument]
[Zusammenfassung]
| Obwohl das Weihnachtsoratorium von J. S. Bach wohl zu seinen populärsten Schöpfungen
zählen dürfte, wird es in der musiktheoretischen Literatur erstaunlicherweise nur
wenig beleuchtet. Dabei handelt es sich bei näherer Betrachtung um ein komplexes
und höchst streng durchkomponiertes Werk, mit einer hohen logischen Disposition.
Diese Arbeit versucht mit Hilfe diverser mathematischer Methoden
die Entwicklung eines hypothetischen Konstruktionsprozesses nachzubilden,
um gleichzeitig neue Wege der musikanalytischen Durchdringung einer gehaltvollen
Komposition aufzuzeigen.
Dabei werden historische Fakten, biographische Bezüge, relevante Aspekte der Aufführung
und Rezeption sowie kompositorisch-ästhetische Fragestellungen umfassend in die
Werkbetrachtung integriert. Eine Besonderheit ist die modellhafte
»Mittelgrund-Rekonstruktion«, die als eine exemplarische und übergreifende Orienterungshilfe
beim Verstehensprozess komplexer Werke dienen kann. |
|
[tfp22]
Trancón y Widemann, Baltasar and Lepper, Markus
Sig-adLib: A Compilable Embedded Language for Synchronous Data-Flow Programming on the Java Virtual Machine
in: Draft Proc. TFP 2022, pg.84-105,
Nicolas Wu and Wouter Swierstra(edts.)
(virtual), 2022
[.pdf document]
|
[funcode22]
Markus Lepper and Baltasar Trancón y Widemann and Michael Oehler
funCode -- Versatile Syntax and Semantics for Functional Harmonic Analysis Labels
in: Music & Science, Thousand Oaks, CA, 2022
[.1177/20592043221085659 document]
|
[funcodeTR]
Markus Lepper and Baltasar Trancón y Widemann and Michael Oehler
funCode 1.0 -- Technical Report
osnaDocs, Osnabrück, 20220126
doi:10.48693/28
|
[synopsis22]
Markus Lepper
Synopsis of the Major Encyclopedias of Traditional Western Music Notation
osnaDocs, Osnabrück, 20220126
doi:10.48693/27
|
[mplr21]
Baltasar Trancón y Widemann and Markus Lepper
LLJava Live at the Loop --
A Case for Heteroiconic Staged Meta-Programming
in: MPLR --- Managed Prorgramming Languages 2021, pg.113-126,
ACM, Münster, 2021
doi:10.1145/3475738.3480942
[.pdf document]
|
[lmn21]
Lepper, Markus
de Linguis Musicam Notare
Universität Osnabrück, Osnabrück, 2021
ISBN 978-3-94025-88-4
[.html?id=150-Dokument]
(talk on the Jahrestagung der Carl Stumpf Gesellschaft, (reconstructed)
.
|
[top21]
Markus Lepper and Baltasar Trancón y Widemann
Technical Topologies of Text
in: Digital Studies/Le champ numérique, Nr.1, Vol.11, the web, 2021
doi:10.16995/dscn.313
|
[wflp20]
Baltasar Trancón y Widemann and Markus Lepper
Practical Idiomatic Considerations for Checkable~Meta-Logic in Experimental Functional
Programming
in: Functional and Constraint Logic Programming, 28th International Workshop, WFLP 2020,
Bologna, 2020
doi:10.1007/978-3-030-75333-7_2
|
[gmth19]
Markus Lepper and Michael Oehler and Hartmuth Kinzler and Baltasar Trancón y Widemann
Mathematische Remodellierung zur Erforschung der exakten Semantik
einfacher konventioneller Notationssysteme
in: Tagungsband Jahreskongress 2019 der Gesellschaft für Musiktheorie,
Zürich, 20231221
doi:10.31751/p.v.10
|
[lokt20]
Markus Lepper and Michael Oehler and Hartmuth Kinzler and Baltasar Trancón y Widemann
Crowded Staves --- Rules for Semantics and Style of Conventional
Multiple-Voices-Per-Staff Musical Notation
in: Proceedings of the TENOR 2020 conference, pg.1-12,
Hamburg, 2020
[.html document]
|
[wflp2019]
Baltasar Trancón and Markus Lepper
Improving the Performance of the Paisley Pattern-Matching EDSL by Staged
Combinatorial Compilation
in: Declarative Programming and Knowledge Management, LNAI, Vol.12057,
Springer, Cham, CH, 2019
ISBN 978-3-030-46713-5
[.1007/978-3-030-46714-2 document]
|
[gesetzestexte]
Markus Lepper und Baltasar Trancón y Widemann
Bezugnahme auf Bestandteile von Gesetzestexten als Problem der
angewandten Rechts- und Informationswissenschaften
in: jurPC, Macrolog AG, Wiesbaden, 2019
doi:10.7328/jurpcb20193412154
[.de/jurpc/show?id=20190153-Dokument]
[Zusammenfassung]
| In zivilen freiheitlichen Gesellschaften müssen Gesetzestexte, Urteile, Kommentare,
Ausführungsbestimmungen etc. für
verschiedenste Anwendergruppen einfach zugänglich und inhaltlich verständlich sein.
Dazu dienen mehr und mehr elektronische Medien, insbesondere digitaltechnische
Aufarbeitungs- und Präsentationsfunktionen.
Ein wichtiges Element sind dabei die in den Texten enthaltenen
Bezugnahmen auf Bestandteile von Gesetzestexten.
Eine genaue Analyse von deren Struktur und Bedeutung ist Voraussetzung für
ihre informationstechnische Behandlung.
Diese Analyse ist aber weit darüber hinaus auch erhellend für den alltäglichen Sprachgebrauch
und die überraschend komplexen Eigengesetze der verwendeten Begrifflichkeit.
Dieser Aufsatz klärt den Unterschied zwischen Informationsgehalt, Semantik
und externer Repräsentation. Er schlägt vor eine einfache kleine formale Sprache, um
die empirische Vielfalt letzterer exakter zu fassen und intellektuell wie
technisch handhabbar zu machen. |
|
[dynamic19]
Markus Lepper and Michael Oehler and Hartmuth Kinzler and Baltasar Trancón y Widemann
Diminuendo al bottom —- Clarifying the semantics of music notation by re-modeling
in: Plos ONE, Public Library of Science, San Francisco, CA, 20191122
doi:10.1371/journal.pone.0224688
[.0224688 document]
[abstract]
| One of many aspects of musical notation is that of a graphical language which
strives to be totally precise, but falls short because it has been defined
by historical evolution, cultural construction and de-central ramification.
This article applies standard techniques for computer languages
to reconstruct a precise
model for the syntax and semantics of the historically grown notation systems,
taking the conventional way of notating musical dynamics as a simple example.
It turns out that no single such model is possible, but a multitude of
incompatibles: some have fundamentally different evaluation algorithms,
others only slightly different parameter settings.
Musical practice is allowed to switch between these models without even noticing their existence,
but science may need distinctness.
This article constructs and demonstrates an extensible mathematical framework for their
precise description and proposes an extensible nomenclature system as a basis for
their application and discussion. |
|
[msplit]
Markus Lepper and Baltasar Trancón
metricSplit: An Automated Notation of Rhythm Aligned with Metric Structure
in: Journal of Mathematics and Music, Taylor Francis, London, 2019
doi:10.1080/17459737.2019.1600753
[abstract]
| For any musical rhythm given by a sequence of duration values as rational numbers,
traditional common western notation (CWN) provides infinite
possibilities for its notation, using the standard devices: note symbols, prolongation dots,
ties, and proportional brackets.
But given additionally a musical meter, which in CWN
is some hierarchical organisation of time points, repeated with every measure,
this number is significantly reduced to those aligned with both meter and rhythm.
For an automatically generated rhythm,
for instance by algorithmic composition or analysis, such a notation should be
found automatically, too.
This is achieved by the algorithm \msplit, presented in this paper.
The necessary analysis and modeling shall also serve as a contribution to
theoretical discussion. |
|
[sigadlib2018]
Baltasar Trancón y Widemann and Markus Lepper
Sig adLib
--- Mostly Compositional Clocked Synchronous Data-Flow Programming in Java
in: Tagungsband des 35ten Jahrestreffens der
GI-Fachgruppe “Programmiersprachen und Rechenkonzepte”, IFI Reports, Vol.482, pg.31-48,
University of Oslo, Oslo, 2018
ISBN 978-82-7368-447-9
ISSN 0806-3036
[.no/URN:NBN:no-65294 document]
[abstract]
| We present Sig adLib, a lightweight embedded domain-specific
declarative language for clocked synchronous data-flow programming on
the Java host platform. The design demonstrates how to reduce data-flow
programs, which are known to have non-compositional properties, to a
pair of separate, compositional aspects that specify data and control flow,
respectively. Sig adLib can be used direcly as a conservative extension
of Java, as a target for domain-specific meta-programming, and as a
backend for its companion stand-alone language Sig. |
|
[rewriting2018]
Markus Lepper and Baltasar Trancón y Widemann
Rewriting for Parametrization
in: Tagungsband des 35ten Jahrestreffens der
GI-Fachgruppe “Programmiersprachen und Rechenkonzepte”, IFI Reports, Vol.482, pg.51-67,
University of Oslo, Oslo, 2018
ISBN 978-82-7368-447-9
ISSN 0806-3036
[.no/URN:NBN:no-65294 document]
[abstract]
| With a modular architectures of source text objects, a method
of free rewriting can be more adequate than pre-wired parameters: each
module import can be accompanied with a set of rewriting rules, mapping
references to expressions and thus adapting the imported definitions to
the needs of the importer. Such a mechanism is described in this paper;
it has been implemented in the d2d system applied to document types,
but seems applicable also for other architectures with a “glass box” view
to modules.
There are two fundamentally different use cases: rewriting (a) to alge-
braic semantics, e.g. for controlling a parsing process, and (b) reifying
the rewritten results, for documentation, statistics, automated user di-
alogue, etc. The second case needs much more effort than the first. For
both cases an algorithm is presented, which is designed for optimized per-
formance, and which reflects details rising from experiences in practical
applications.
The transfer to other languages is supported by a division of the second
algorithm into a generic and a specific part. |
|
[mdoelingemp]
Markus Lepper
Modeling Empowerment
berlin, 2018
[.html-Dokument]
|
[metricsplitTR]
Markus Lepper and Baltasar Trancón y Widemann
metricSplit: Automated Notation of Rhythms Adequate to a Metric Structure
Universität Ilmenau, Ilmenau, 2017
https://nbn-resolving.org/urn:nbn:de:gbv:ilm1-2017200259
|
[translets2016]
Markus Lepper and Baltasar Trancón y Widemann
Translets —--
Parsing Diagnosis in Small DSLs, with Permutation Combinator
and Epsilon Productions
in: Tagungsband des 35ten Jahrestreffens der
GI-Fachgruppe “Programmiersprachen und Rechenkonzepte”, IFI Reports, Vol.482, pg.114-129,
University of Oslo, Oslo, 2018
ISBN 978-82-7368-447-9
ISSN 0806-3036
[.no/URN:NBN:no-65294 document]
[abstract]
| Translets is a light-weight embedded domain-specific language
for easy implementation of small text parsers, which serve as the front-
ends of light-weight non-embedded domain-specific languages. In many
situations these are required for the processing of readable and conve-
nient denotations of values from complex, domain-specific data types.
Translets is a parser combinator library to enable also domain experts,
who are neither computing scientists nor language experts, to design
small, ad-hoc languages for their realm. This is supported by these de-
sign criteria:
(1) Both sides, the syntax of the input and the data type of the generated
parser’s output, are defined together and in strict correspondence, thus
explaining each other;
(2) parsing handles non-determinism and hides most technical details
from the user;
(3) the resulting data is immediately accessible after parsing, without
further transformation steps or analysis.
(4) extensive error messages are generated in case of parsing failure, and
detailed diagnostic information can be retrieved also in case of success.
The synthesis of sensible error messages is a challenge esp. in combina-
tion with permutation parsers and epsilon productions and is the main
contribution in this article. Translets have been successfully employed in
widely varying contexts, from graphic animation scripts to conventional
music notation. |
|
[mdWald]
Markus Lepper
Vom Wesen des Waldwebens
Anmerkungen zu der Markus Dräses Projekt "Plänterwald"
(self), (the web), 2016
[.html-Dokument]
|
[ceur2016]
Baltasar Trancón y Widemann and Markus Lepper
Higher-Order Causal Stream Functions in Sig from First Principles
in: Software Engineering (Workshops), CEUR Workshops, Vol.1559, pg.25-39,
?, 2016
ISSN = 1613-0073
[.pdf document]
[abstract]
|
The Sig programming language is a total functional,
clocked synchronous data-flow language. Its core has been designed
to admit concise coalgebraic semantics. Universal coalgebra is an
expressive theoretical framework for behavioral semantics, but
traditionally phrased in abstract categorical language, and
generally considered inaccessible. In the present paper, we
rephrase the coalgebraic concepts relevant for the Sig
language semantics in basic mathematical notation. We demonstrate
how the language features characteristic of its paradigms, namely
sequential and parallel
composition
for applicative style,
delay
for data flow, and
apply
for higher-order
functional programming, are shaped naturally by the semantic
structure. Thus the present paper serves two purposes, as a gentle,
self-contained and applied introduction to coalgebraic semantics,
and as an explication of the Sig core language
denotational and operational design.
|
|
[d2dTut]
Markus Lepper und Baltasar Trancón y Widemann
D2d - Kreatives Schreiben von XML-codierten Texten
in: Informatik 2016 (GI Jahrestagung), pg.1935-1940,
C. Mayr und Martin Pinzge(Hrsg.)
GI, Bonn, 2016
ISBN 978-3-88579-653-4
[.12116/1082-Dokument]
|
[masses2016]
Baltasar Trancón y Widemann and Markus Lepper
Coinductive Program Synthesis for the Masses
in: Proc. Coalgebraic Methods in Computer Science (CMCS 2016),
?, 2016
[.pdf document]
|
[fvf3nachw]
Markus Lepper
Der Formen von Fuge Drittes Heft
Nachwort zu op. 37
(self), (the web), 2016
[.html-Dokument]
|
[paisleyControl]
Baltasar Trancón y Widemann and Markus Lepper
A Practical Study of Control in Objected-Oriented--Functional--Logic Programming with Paisley
in: Proc. Functional--Logic Programming (WFLP 2016), Vol.234,
EPTCS, world, 2016
[.cgi?WFLP2016 document]
[abstract]
| Paisley is an extensible lightweight embedded domain-specific
language for nondeterministic pattern matching in Java. Using
simple APIs and programming idioms, it brings the power of
functional--logic processing of arbitrary data objects to the Java
platform, without constraining the underlying object-oriented
semantics. Here we present an extension to the Paisley framework
that adds pattern-based control flow. It exploits recent additions
to the Java language, namely functional interfaces and lambda
expressions, for an explicit and transparent continuation-passing
style approach to control. We evaluate the practical impact of the
novel features on a real-world case study that reengineers a
third-party open-source project to use Paisley in place of
conventional object-oriented data query idioms. We find the
approach viable for incremental refactoring of legacy code,
with significant qualitative improvements regarding separation of
concerns, clarity and intentionality, thus making for easier code
understanding, testing and debugging. |
|
[lljava2016]
Baltasar Trancón y Widemann and Markus Lepper
LLJava: Minimalist Structured Programming on the Java Virtual Machine
in: Proc. Principles and Practices of Programming on the Java Platform (PPPJ 2016),
ACM, New York, 2016
ISBN 978-1-4503-4135-6
doi:10.1145/2972206.2972218
[.pdf document]
[abstract]
| There is a wide gap in abstraction level between Java source code
and JVM bytecode. Many important software-related tasks, such as
specification and implementation of code synthesis procedures, code
inspection, software understanding and teaching, can benefit from an
adequate, intermediate level of abstraction. Available bytecode
assembly/disassembly tools are ad-hoc and fall short of the
requirements regarding compositionality and clarity. We report on
the design and implementation of the LLJava language that bridges
the gap, based on careful analysis of bytecode information and
rigorous design. |
|
[mdNh2015]
Markus Lepper
Markus Draeses Altes Heim
(self), (the web), 2015
[.html-Dokument]
|
[maDrei]
Markus Lepper
Gustav Mahler, Dritte Sinfonie, Erste Abtheilung
Eine Annäherung
(self), (the web), 2015
zu finden bei
http://senzatempo.de/mahler/gmahler_sinf3_satz1.html
|
[rta2015]
Markus Lepper and Baltasar Trancón y Widemann
A Simple and Efficient Step Towards Type-Correct XSLT Transformations
in: Proceedings 26th International Conference on Rewriting Techniques and Applications (RTA 2015), LIPICS, Vol.36, pg.350--364,
Dagstuhl Publishing, Saarbrücken/Wadern, 2015
doi:10.4230/LIPIcs.RTA.2015.350
ISBN 978-3-939897-85-9
[abstract]
| XSLT 1.0 is a standardized functional programming language and widely
used for defining transformations on XML models and documents,
in many areas of industry and publishing.
The problem of XSLT type checking is to verify that
a given transformation, when applied to an input which conforms to
a given structure definition, e.g. an XML DTD, will always produce an output which
adheres to a second structure definition. This problem is known to be
undecidable for the full range of XSLT and document structure definition languages.
Either one or both of them must be significantly restricted,
or only approximations can be calculated.
The algorithm presented here takes a different approach towards type
correct XSLT transformations.
It does not consider the type of the input document at all.
Instead it parses the fragments of the result
document contained
verbatim in the transformation code and
verifies that these can potentially appear in the result language,
as defined by a given DTD.
This is a kind of abstract interpretation,
which can be executed on the fly and in linear time when parsing
the XSLT program. Generated error messages are located accurately to a
child subsequence of a single result element node.
Apparently the method eliminates a considerable
share of XSLT programming errors, on the same order of magnitude as a full fledged
global control-flow analysis. |
|
[TranconyWidemann2015d]
Trancón y Widemann, Baltasar and Lepper, Markus
Simple and Effective Relation-Based Approaches To XPath and XSLT Type Checking
in: Tagungsband des 36ten Jahrestreffens der
GI-Fachgruppe “Programmiersprachen und Rechenkonzepte”, IFI Reports, Vol.488, pg.36-46,
University of Oslo, Oslo, 2019
ISBN 978-82-7368-453-0
ISSN 0806-3036
[.no/URN:NBN:no-75603 document]
[abstract]
XPath is a language for addressing parts of an XML document. We give
an abstract interpretation of XPath expressions in terms of
relations on document node types.
Node-set-related XPath
language constructs are mapped straightforwardly onto basic,
well-understood and easily computable relational operations. Hence
our interpretation gives both extremely concise type-level
denotational semantics and a practical analysis tool for the
node-set fragment of the XPath\,1.0 language. This method is part of
the TPath implementation of XPath.
XSL-T is a pure functional language for transforming XML documents.
For the most common case, the transformation into an XML document,
type checking of the transformation code is unfeasible in general, but strongly
required in practice. It turned out that the relational approach of TPath
can be carried over to check all fragments of the result language, which are
contained verbartim in the transformation code. This leads to a technique
called ``Fragmented Validation'' and is part of the txsl implementation of XSL-T.
|
|
[tfp2015]
Baltasar Trancón y Widemann and Markus Lepper
Laminar Data Flow: On the Role of Slicing in Functional Data-Flow Programming
in: Proceedings Trends in Functional Programming (TFP 2015), LNCS, Vol.9547,
Springer, Berlin, Heidelberg, New York, 2015
doi:10.1007/978-3-319-39110-6_5
ISBN 978-3-319-39109-0
[abstract]
| We use the concept of laminar flow, as opposed to turbulent flow,
as a metaphor for the decomposition of well-behaved purely
functional data-flow programs into largely independent parts,
necessitated by aspects with different execution constraints. In
the context of the total functional data-flow language
Sig, we identify three distinct but methodologically related
implementation challenges, namely multi-rate scheduling,
declarative initialization, and conditional execution, and
demonstrate how they can be solved orthogonally, by decomposition
using the standard program transformation technique, slicing. |
|
[pppj2015]
Baltasar Trancón y Widemann and Markus Lepper
On-Line Synchronous Total Purely Functional Data-Flow
Programming on the Java Virtual Machine with Sig
in: Proceedings 12th International Conference on Principles and Practice
of Program, pg.37--50,
ACM, New York, 2015
doi:10.1145/2807426.2807430
ISBN 978-1-4503-3712-0
[abstract]
| Sig is the prototype of a purely declarative programming
language and system for the processing of discrete, clocked
synchronous, potentially real-time data streams. It aspires to
combine good static safety, scalability and platform independence,
with semantics that are precise, concise and suitable for domain
experts. Its semantical and operational core has been formalized.
Here we discuss the general strategy for making Sig
programs executable, and describe the current state of a prototype
compiler. The compiler is implemented in Java and targets the JVM.
By careful cooperation with the JVM just-in-time compiler, it
provides immediate executability in a simple and quickly extensible
runtime environment, with code performance suitable for moderate
real-time applications such as interactive audio synthesis. |
|
[deadAround]
Markus Lepper
Are the Dead Around Us and Will We Meet Them Again?
self, The Web, 2015
[.pdf document]
|
[farm2015]
Baltasar Trancón y Widemann and Markus Lepper
The Shepard Tone and Higher-Order Multi-Rate Synchronous Data-Flow Programming in Sig
in: Proceedings 3rd ACM SIGPLAN International Workshop on Functional Art, Music,
Modeling and Design, FARM 2015, pg.6--14,
ACM, New York, 2015
doi:10.1145/2808083.2808086
ISBN 978-1-4503-3806-6
[abstract]
| The total functional real-time data-flow programming language Sig
features a core layer with elegant denotational semantics, in terms
of Mealy stream transducers and coiterative causal stream functions,
that is convenient for domain experts in the primary application
domains, such as scientific modeling and digital music and event
arts. The core suffices for the implementation of many basic signal
processing components. For the expression of more sophisticated
computations, a second layer of Sig provides additional features,
namely higher-order functional programming and multi-rate
synchronicity, reducible by transformational semantics to the core
layer. Here we describe the design of the upper layer of Sig and
demonstrate its usage with the Shepard Tone, a well-known sound
synthesis problem and model of psycho-acoustically paradoxical
perception of relative musical pitch. |
|
[farm2014]
Trancón y Widemann, Baltasar and Lepper, Markus
Sound and Soundness: Practical Total Functional Data-flow Programming
in: Proceedings of the 2Nd ACM SIGPLAN International Workshop
on Functional Art, Music, Modeling & Design, FARM '14, pg.35--36,
ACM, New York, NY, USA, 2014
doi:10.1145/2633638.2633644
ISBN 978-1-4503-3039-8
[.pdf document]
[abstract]
| The field of declarative data-stream programming (discrete time,
clocked synchronous, compositional, data-centric) is divided between
the visual data-flow graph paradigm favored by domain experts, the
functional reactive paradigm favored by academics, and the
synchronous paradigm favored by developers of low-level systems.
Each approach has its particular theoretical and practical merits
and target audience. The programming language Sig has been
designed to unify the underlying paradigms in a novel way. The
natural expressivity of visual approaches is combined with the
support for concise pattern-based symbolic computation of functional
programming, and the rigorous, elementary semantical foundation of
synchronous approaches. Here we demonstrate the current state of
implementation of the Sig system by means of example programs
that realize typical components of digital sound synthesis. |
|
[msfp2014]
Trancón y Widemann, Baltasar and Lepper, Markus
Foundations of Total Functional Data-Flow Programming
in: =
Proceedings 5th Workshop on Mathematically Structured Functional Programming,
MSFP 2014, Grenoble, France, 12 April 2014., pg.143--167,
Earth, 2014
doi:10.4204/EPTCS.153.10
[.10 document]
[abstract]
| The field of declarative stream programming (discrete time, clocked
synchronous, modular, data-centric) is divided between the data-flow
graph paradigm favored by domain experts, and the functional
reactive paradigm favored by academics. In this paper, we describe
the foundations of a framework for unifying functional and data-flow
styles that differs from FRP proper in significant ways: It is based
on set theory to match the expectations of domain experts, and the
two paradigms are reduced symmetrically to a low-level middle
ground, with strongly compositional semantics. The design of the
framework is derived from mathematical first principles, in
particular coalgebraic coinduction and a standard relational model
of stateful computation. The abstract syntax and semantics
introduced here constitute the full core of a novel stream
programming language. |
|
[cmcs2014]
Trancón y Widemann, Baltasar and Lepper, Markus
Foundations of Total Functional Data-Flow Programming, coniductively
in: Proceedings of the 12th International Workshop on
Coalgebraic Methods in Computer Science, CMCS, 2014, Grenoble, France, 5. April 2014.,
Earth, 2014
[.pdf document]
[abstract]
| The field of declarative data stream programming (discrete time,
clocked synchronous, modular, data-centric) is divided between the
data-flow graph paradigm favored by domain experts, and the
functional reactive paradigm favored by academics. In the
summarized paper, we describe the foundations of a framework for
unifying functional and data-flow styles that differs from FRP
proper in significant ways: It draws on semantic objects from plain
set theory to match the expectations of domain experts, and the two
paradigms are reduced symmetrically to a low-level middle ground,
with strongly compositional semantics. The design of the framework
is derived from mathematical first principles, in particular
coalgebraic coinduction and a standard relational model of stateful
computation. Abstract syntax and semantics are given and constitute
the full core of a novel stream programming language. |
|
[calco2014]
Trancón y Widemann, Baltasar and Lepper, Markus
Towards (Co)Algebraic Semantics of the Object-Oriented
Rewriter Style Pattern
in: Calco Early Ideas, Selected Papers, pg.49--62,
Bartek Klin and Monika Seisenberger(edts.)
theWeb, 2014
[.pdf document]
[abstract]
| Conventional object-oriented programming languages provide
expressive, declarative means for data abstraction, but they lack
similarly powerful counterparts for control abstraction. Style
patterns have been developed as informal solutions to the problem.
They fall short of real abstraction, because they mostly give no
criteria how to use imperative language elements in a disciplined
way for denotational semantics to be applied effectively. We
discuss the Rewriter pattern, an extension of the well-known Visitor
pattern, that expresses type-directed rewriting rules for arbitrary
object graphs in a relatively declarative style. We demonstrate how
to ground the Rewriter pattern in coalgebraic recursion theory, in
particular the course-of-argument coiteration scheme, based on a
formal model of object graphs as finite coalgebras. |
|
[isola2014]
Markus Lepper and Baltasar Trancòn y Widemann
Rewriting Object Models With Cycles and Nested Collections
in: Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change, LNCS, Vol.8802, pg.445-460,
Margaria, Tiziana and Steffen, Bernhard(edts.)
Springer, Berlin Heidelberg, 2014
ISBN 978-3-662-45233-2
doi:10.1007/978-3-662-45234-9_31
[.pdf document]
[abstract]
| Metaprogramming with classical compiler technology is similar to
model-based code generation. We discuss a particular tool,
umod, that generates complex data model implementations in
Java, and a particular aspect of its support for declarative
programming: The rewriting of data models in object-oriented
style, based on the visitor pattern, with support for arbitrary
reference graphs and nested collection-valued fields. We
demonstrate that concerns of both compiler theory and model-based
development apply, and that the distinction is overshadowed by a
general commitment to semantic rigour. |
|
[paisleyXpath]
Baltasar Trancón y Widemann and Markus Lepper
Interpreting XPath by Iterative Pattern Matching in Paisley
in: Proc. Functional--Logic Programming (WFLP 2014), Vol.234,
EPTCS, world, 2014
[.org/Vol-1335/ document]
[abstract]
| The Ppaisley architecture is a light-weight EDSL for
non-deterministic pattern matching. It automates the querying of
arbitrary object-oriented data models in a general-purpose
programming language, using API, libraries and simple programming
patterns in a portable and non-invasive way. The core of Paisley
has been applied to real-world applications. Here we discuss the
extension of Paisley by pattern iteration, which
adds a Kleene algebra of pattern function composition to the
unrestricted use of the imperative host language, thus forming a
hybrid object-oriented--functional--logic framework. We subject it
to a classical practical problem and established benchmarks: the
node-set fragment of the XPath language for querying W3C XML
document object models. |
|
[TranconyWidemann2013e]
Trancón y Widemann, Baltasar und Lepper, Markus
Syntaxanalyse auf Wiedervorlage
in: Proceedings 17.\ Kolloquium Programmiersprachen (KPS 2013), Technical Report, Nr.2014/02, pg.151--154,
Picht, R und Zimmermann, W.(Hrsg.)
Institute of Computer Science, Martin-Luther-Universität Halle-Wittenberg, Halle, Wittenberg, 2013
[.php?down=35800&elem=2813059-Dokument]
|
[lt_tscore13]
Lepper, Markus and Trancón y Widemann, Baltasar
tscore: Makes Computers and Humans Talk About Time
in: Proc. KEOD 2013, 5th Int. Conference on Knowledge Engineering
and Ontology Development, pg.176-183,
Joaquim Filipe and Jan Dietz(edts.)
Instincc, Portugal, 2013
ISBN 978-989-8565-81-5
doi:10.5220/0004540701760183
[.pdf document]
This text has been presented on the
KEOD 2013 conference
, here are
the slides.
[abstract]
Textual denotation of temporal data is a challenge.
In different domains very different notation systems
have been developed for pen and paper during history,
reflecting domain specific theory and practice.
They work with symbolic representation of activities
and combined expressional and spatial representation of time.
In contrast, existing computer-readable formats are
either simple lists or complicated expression languages.
The formalism and software presented here, called
tscore
, try to bridge the gap between these two worlds
by studying the most advanced example of the former,
the Conventional Western Notation of music.
By abstracting its basic principles, a generic notation framework
is defined, suited for reading and writing by both humans and computers.
The syntactic framework of the front-end representation
and a mathematical formulation of the underlying semantics
are given, which both are parameterisable
and allow to plug in application specific parsers and data models.
The current state of library implementation is shortly sketched,
together with a practical example of moderately complex music notation.
|
|
[lt_xslt13]
Lepper, Markus and Trancón y Widemann, Baltasar
Fragmented Validation --- A Simple and Efficient Contribution to XSLT
Checking (Extended Abstract)
in: Proc. ICMT 2013, Int. Conference on Theory and Practice of
Model Transformations, LNCS, Vol.7909,
Springer, Berlin, 2013
ISBN 9783642388835
[abstract]
XSLT 1.0 is a standardized functional programming language and widely
used for defining transformations on XML models and documents,
in many areas of industry and publishing.
The problem of \emph{XSLT type checking} is to verify that
a given transformation, when applied to an input which conforms to
a given structure definition, e.g. an XML DTD, will always produce an output which
adheres to a second structure definition. This problem is known to be
undecidable for the full range of XSLT and document structure definition languages.
Either one or both of them must be significantly restricted,
or only approximations can be calculated.
The algorithm presented here takes a different approach towards type
correct XSLT transformations.
It does not consider the input document at all.
Instead it parses the fragments of the output document contained
verbatim
in the transformation code and
verifies that these can potentially appear in the result language,
as defined by a given DTD.
This is a kind of
abstract interpretation
,
which can be executed on the fly and in linear time when parsing
the XSLT program. Generated error messages are reasonable accurate.
To our practical
experience, this eliminates a considerable share of XSLT programming errors.
|
|
[lt_ddd2013]
Lepper, Markus and Trancón y Widemann, Baltasar
D2d -- XML for Authors
in: Tagungsband des 36ten Jahrestreffens der
GI-Fachgruppe “Programmiersprachen und Rechenkonzepte”, IFI Reports,
University of Oslo, Oslo, 2019
ISBN 978-82-7368-453-0
ISSN 0806-3036
[.no/URN:NBN:no-75603 document]
|
[tl_rewshort2013]
Trancón y Widemann, Baltasar and Lepper, Markus
Towards a (Co)Algebraic Semantics for the Object-Oriented Rewriter Pattern
in: Proc. CALCO Early Ideas Workshop,
Warsaw, 2013
[abstract]
| Standard object-oriented programming practice features powerful
declarative means for the definition of data models, but relegates
their processing to imperative code. Coding style patterns to
emulate declarative processing techniques, such as graph traversal
and rewriting, have evolved slowly. They are discussed in
literature mostly on the informal, pragmatic and operational level.
Here, we outline an approach towards denotational semantics for
these patterns. To this end, we consider a formalization of
object-oriented data models in terms of interleaved algebraic and
coalgebraic realms. We demonstrate that a corresponding
interleaving of the associated recursion and corecursion schemes,
respectively, captures the functional essence of the object-oriented
rewriter style pattern. The composite recursion scheme is
interesting in its own right, as a unified, flexible generalization
of the dual, primordial schemes of iteration and coiteration. |
|
[tl_paisleyWflp2013]
Trancón y Widemann, Baltasar and Lepper, Markus
Some Experiments on Light-Weight Object-Functional-Logic Programming in Java with Paisley
in: Kiel Declarative Programming Days 2013, Technische Berichte des Instituts für Informatik, Vol.1306, pg.32-46,
Christian-Albrechts-Universität zu Kiel, Kiel, 2013
ISSN 2192-6247
[.pdf document]
[abstract]
|
The
Paisley
library and embedded domain-specific language
provides light-weight nondeterministic pattern matching on the Java
platform. It fully respects the imperative semantics and data
abstraction of the object-oriented paradigm, while leveraging the
declarative styles of pattern-based querying and searching of
complex object models. Previous papers on
Paisley
have focused
on the functional paradigm and data flow issues. Here, we
illustrate its use under the logic paradigm. We discuss the
expressiveness and evaluate the performance of
Paisley
in terms
of the well-known combinatorial search problem ``send more money''
and its generalizations.
|
|
[tl_paisleyKdpd2013]
Trancón y Widemann, Baltasar and Lepper, Markus
Some Experiments on Light-Weight Object-Functional-Logic Programming in Java with Paisley
in: Declarative Programming and Knowledge Management, LNAI, Vol.8439, pg.218-233,
Springer International Publishing, Berlin, 2014
[abstract]
|
The
Paisley
library and embedded domain-specific language
provides light-weight nondeterministic pattern matching on the Java
platform. It fully respects the imperative semantics and data
abstraction of the object-oriented paradigm, while leveraging the
declarative styles of pattern-based querying and searching of
complex object models. Previous papers on
Paisley
have focused
on the functional paradigm and data flow issues. Here, we
illustrate its use under the logic paradigm. We discuss the
expressiveness and evaluate the performance of
Paisley
in terms
of the well-known combinatorial search problem ``send more money''
and its generalizations.
|
|
[ifl2014]
Trancón y Widemann, Baltasar and Lepper, Markus
Towards Execution of the Synchronous Functional Data-Flow Language Sig
in: Implementation and Application of Functional Languages,
Boston, 2014
fulltext
|
[msfp2014]
Trancón y Widemann, Baltasar and Lepper, Markus
Foundations of Total Functional Data-Flow Programming
in: =
Proceedings 5th Workshop on Mathematically Structured Functional Programming,
MSFP 2014, Grenoble, France, 12 April 2014., pg.143--167,
the Web, 2014
doi:10.4204/EPTCS.153.10
[.10 document]
[abstract]
| The field of declarative data stream programming (discrete time,
clocked synchronous, modular, data-centric) is divided between the
data-flow graph paradigm favored by domain experts, and the
functional reactive paradigm favored by academics. In the
summarized paper, we describe the foundations of a framework for
unifying functional and data-flow styles that differs from FRP
proper in significant ways: It draws on semantic objects from plain
set theory to match the expectations of domain experts, and the two
paradigms are reduced symmetrically to a low-level middle ground,
with strongly compositional semantics. The design of the framework
is derived from mathematical first principles, in particular
coalgebraic coinduction and a standard relational model of stateful
computation. Abstract syntax and semantics are given and constitute
the full core of a novel stream programming language. |
|
[cmcs2014]
Trancón y Widemann, Baltasar and Lepper, Markus
Foundations of Total Functional Data-Flow Programming, coniductively
in: Proceedings of the 12th International Workshop on
Coalgebraic Methods in Computer Science, CMCS, 2014, Grenoble, France, 12 April 2014.,
Earth, 2014
[.pdf document]
[abstract]
| The field of declarative data stream programming (discrete time,
clocked synchronous, modular, data-centric) is divided between the
data-flow graph paradigm favored by domain experts, and the
functional reactive paradigm favored by academics. In the
summarized paper, we describe the foundations of a framework for
unifying functional and data-flow styles that differs from FRP
proper in significant ways: It draws on semantic objects from plain
set theory to match the expectations of domain experts, and the two
paradigms are reduced symmetrically to a low-level middle ground,
with strongly compositional semantics. The design of the framework
is derived from mathematical first principles, in particular
coalgebraic coinduction and a standard relational model of stateful
computation. Abstract syntax and semantics are given and constitute
the full core of a novel stream programming language. |
|
[paisleyAtps]
Trancón y Widemann, Baltasar and Lepper, Markus
Paisley: A Pattern Matching Library for Arbitrary Object Models
in: Proc. 6. Arbeitstagung Programmiersprachen (ATPS 2013), LNI, Vol.215, pg.171-186,
Stefan Wagner and Horst Lichter(edts.)
Gesellschaft für Informatik, Bonn, 2013
ISBN 978-3-88579-609-1
[.pdf document]
[abstract]
|
Professional development of software dealing with structured models
requires more systematic approach and semantic foundation than
standard practice in general-purpose programming languages affords.
One remedy is to integrate techniques from other programming
paradigms, as seamless as possible and without forcing programmers
to leave their comfort zone. Here we present a tool for the
implementation of
pattern matching
as fundamental means of
automated data extraction from models of arbitrary shape and
complexity in a general-purpose programming language. The interface
is simple but, thanks to elaborate and rigorous design, is also
light-weight, portable, non-invasive, type-safe, modular and
extensible. It is compatible with object-oriented data abstraction
and has full support for nondeterminism by backtracking. The tool
comes as a library consisting of two levels: elementary pattern
algebra (generic, highly reusable) and pattern bindings for
particular data models (specific, fairly reusable, user-definable).
Applications use the library code in a small number of idiomatic
ways, making pattern-matching code declarative in style, easily
writable, readable and maintainable. Library and idiom together
form a tightly embedded domain-specific language; no extension of
the host language is required. The current implementation is in
Java, but assumes only standard object-oriented features, and can
hence be ported to other mainstream languages.
|
|
[lt_tscore12]
Lepper, Markus and Trancón y Widemann, Baltasar
tscore: Makes Computers and Humans Talk About Time
in: Sound und Performance, 11. Kongress der Ges.f. Theaterwissenschaft,
Bayreuth, 2012
[.pdf document]Our topic was quite exotic in this conference's context,
which was about theatre and performance (where our project is aiming at!)
It was a very fruitful exchange and a nice conference, but they didn't want
us for the post-proceedings, so the link above is for the SLIDES.[abstract]
|
Textual denotation of music for processing by computer systems is a
tedious task: Professional (i.e. academic or commercial) score processing
systems come either with a prorietary expression language
(lilypond, musixTeX) or with some very technical tabular format (C-sound,
humdrum, MusicXML),
or do not support textual representation at all, leaving the user to
graphical note input or midi files.
Anyhow, a fixed syntax and pre-defined semantics are not appropriate
for scientific or artistic usage, where the
definition
of material, aspects,
parameters and their semantics are already the first steps of
analysis or construction, are already
decisions
.
Our project
tscore
, by contrast, provides a
generic
approach,
where only the
very basic rules of encoding are fixed, and all syntax and semantics are
user-defined, by a processing framework constructed by freely plugging together
pre-defined library components, possibly enhanced by own user code.
This leads to a computer model for structures and semantics
not only of ``music'' in the narrow sense of the word, but for
potentially all
data organised along the time axis.
|
|
[tl_paisley]
Trancón y Widemann, Baltasar and Lepper, Markus
Paisley: Pattern matching a la carte
in: Theory and Practice of Model Transformations 5th. International
Conference, ICMT 2012, Praha, LNCS, Vol.7307,
Springer, Berlin, Heidelberg, New York, 2012
Here are the
slides of my talk
on the
ICMT 2012 conference.
[abstract]
|
Professional development of software dealing with structured models
requires more systematic approach and semantic foundations than
standard practice in general-purpose programming languages affords.
One remedy is to move to domain-specific environments. Here,
instead, we present a tool for the implementation of pattern
matching as fundamental means of automated data extraction from
complex models in a general-purpose programming language. The
interface is simple but, thanks to elaborate and rigorous design, is
also light-weight, portable, non-invasive, type-safe, modular and
extensible. It is compatible with object-oriented data abstraction
and has full support for nondeterminism by backtracking. The tool
comes as a library consisting of two levels: elementary pattern
algebra (generic, highly reusable) and pattern bindings for
particular data models (specific, fairly reusable, user-definable).
Applications use the library code in a small number of idiomatic
ways, making pattern-matching code declarative in style, easily
writeable, readable and maintainable. Library and idiom together
form a tightly embedded domain-specific language; no extension of
the host language is required. The current implementation is in
Java, but assumes only standard object-oriented features, and can
hence be ported to other mainstream languages.
|
|
[tl_kps]
Trancón y Widemann, Baltasar and Lepper, Markus
tSig : Towards Semantics for a Functional Synchronous Signal Language
in: Tagungsband 16. Kolloquium Programmiersprachen
und Grundlagen der Programmierung, Arbeitsberichte des Instituts für Wirtschaftsinformatik, Nr.132, pg.163-168,
Herbert Kuchen and Tim Majchrzak and Markus Müller-Olm(edts.)
Westfälische Wilhelms-Universität Münster, Münster, 2011
ISSN 1438-3985
[.pdf document]
Dies war ein Vortrag von bt auf dem
16. Kolloquium Programmiersprachen und Grundlagen der Programmierung (KPS'11),
und ist enthalten im
Tagungsband.
[Zusammenfassung]
|
Programmierwerkzeuge zur Konstruktion signalerzeugender Systeme
basieren traditionellerweise auf graphischen Datenflussnotationen,
bei denen Signale durch Kanten und Generatoren durch Knoten
dargestellt werden. Einerseits kommt diese Darstellung der
interaktiven und "`spielerischen"' Benutzung durch Informatik-Laien
entgegen. Andererseits fehlen im Vergleich zu funktionalen
Programmiersprachen, dem anderen Paradigma der Wahl für komplexe
Datenerzeugung, zahlreiche ausdrucksmächtige und produktive
Sprachmittel, insbesondere (1) Coprodukte als Grundlage von
Aufzählungs-, Vereinigungs- und algebraischen Typen sowie
Ausnahmebehandlung, (2) Abstraktionen erster Klasse, (3) Pattern
Matching als Mittel der Fallunterscheidung und Datenextraktion, (4)
geschachtelte Ausdrücke als kompakte Notation baumförmigen
Datenflusses. In der Folge bleiben softwaretechnische Belange wie
Modularisierung, Wiederverwendung, Wartung und Vermeidung trivialer
Fehler weitgehend unberücksichtigt; das gilt auch bei kommerzieller
Software für den "professionellen" Sektor.
Die Sprache
tSig
ist ein Entwurf, der die beiden Welten
der funktionalen und Datenfluss-Programmierung vereinen
soll. Syntaktisch stehen dazu zwei Ebenen zur Verfügung, die
kompositional nach Bedarf ineinander eingesetzt und transformiert
werden können: einerseits funktionale Notation mit Termen,
Funktionsabstraktion und Pattern Matching, andererseits eine
algebraische Notation von Datenflussgraphen, vergleichbar der
A-Normalform von Funktionenkalkülen.
Im Vortrag sollen die Grundlagen einer Semantik vorgestellt werden,
die es erlaubt, einerseits totale Funktionen mit partiellen
Berechnungszweigen, andererseits zeitlose funktionale Abhängigkeit
mit zustandsbehafteten Komponenten in Einklang zu
bringen. Langfristiges Ziel ist die ingenieursmäßige Programmierung
komplexer Signale in den Anwendungsbereichen Elektronische Musik und
Simulation von Umweltphänomenen.
|
|
[lt_keod2011]
Lepper, Markus and Trancón y Widemann, Baltasar
d2d --- a Robust Front-End for Prototyping, Authoring and Maintaining
XML Encoded Documents by Domain Experts
in: Proceedings of KEOD 2011 International Conference on
Knowledge Engieering and Ontology Design, pg.449-456,
Joaquim Filipe and Jan L.G. Diets(edts.)
SciTePress, Portugal, 2011
ISBN 978-989-8425-80-5
doi:10.5220/0003664904490456
[.pdf document]
This text has been presented as a
poster
on the
KEOD 2011 conference.
[abstract]
In many cases, domain experts are used to write down their
knowledge in contiguous texts.
A standard way to facilitate the automated processing of
such texts is to add mark-up, for which
the family of XML-based standards is current best practice.
But the default textual appearance
of XML mark-up
is not suited to be typed, read and edited by humans.
The authors'
d2d notation
provides an alternative
which uses only one single escape character.
Its documents can be fluently typed, understood
and edited by humans almost in the same way as non-tagged text.
In the last years, the d2d language underwent a development guided by
practical experiences.
In practice,
robustness
turned out to be
highly desirable: This lead to revised semantics and a new algorithm
which realizes a
total
translation function,
This article gives the complete operational semantics of this algorithm
after a short sketch of its context.
|
|
[lt_ttc2011]
Lepper, Markus and Trancón y Widemann, Baltasar
Solving the TTC 2011 Compiler Optimization Task with meta-tools
in: TTC 2011: Fifth Transformation Tool Contest, EPTCS, Vol.74,
Pieter Van Gorp and Steffen Mazanek and Louis Rose(edts.)
TTC 2011 group, (www), 2011
doi:10.4204/EPTCS.74
(The DOI link brings you to all texts of the EPTCS 74 journal)[abstract]
The authors' metatools are a collection of tools for generic
programming. This includes generating Java sources from mathematically well-founded
specifications, as well as the creation of strictly typed document object
models for XML encoded texts.
In this context, almost every computer-internal structure is
treated as a ``model'', and every computation is a kind of model transformation.
This concept differs significantly from ``classical model transformation'' executed
by specialized tools and languages.
Therefore it seemed promising to the organizers of the
TTC 2011 in Zürich, as well as to the authors, to apply meta-tools
to one of the challenges, namely to the "compiler optimization task",
This is a report on the resulting experiences.
|
|
[ml_et]
Lepper, Markus
Eternal Life -- a Matter of Fact
The Web,, 2012
[.pdf document]
|
[lt_visitorOpt]
Lepper, Markus and Trancón y Widemann, Baltasar
Optimization of Visitor Performance by Reflection-Based Analysis
in: Theory and Practice of Model Transformations 4th. International
Conference, Icmt 2011, Zürich, LNCS, Vol.6707,
Jordi Cabot and Eelco Visser(edts.)
Springer, Berlin, Heidelberg, New York, 2011
ISBN 978-3-642-21731-9
Here are the
publication
and the
slides of my talk in Zürich
[abstract]
| Visitors are a well-known and powerful design pattern
for processing regular data structures and for combining declarative and
imperative coding styles.
The authors' umod model generator
creates java data models from a concise and algebraic notation.
It is primarily used to model intermediate representations
of computer languages.
The user defines visitor code by
extending skeleton classes, which are generated according to
traversal annotations in the model.
Since the generated code on its own executes the pure traversal and
no semantic side-effects, traversals are redundant unless some
user-overridden method is eventually invoked. We present a
reflection-based control flow analysis to detect this situation and
prune the traversal transparently. With a well-stratified model,
this may lead to substantial increase in performance. |
|
[lepperm_nwimtakt]
Markus Lepper
Nachwort zu "imtakt" op. 5
Berlin, 2010
[.pdf-Dokument]
|
[lepperm_mahlernatur]
Markus Lepper
Heile Welt und Unheil im Anmarsch
Synthetische Natur im Werke Gustav Mahlers
Berlin, 2010
[.html-Dokument]
[Zusammenfassung]
Der Mensch schätzt, was er/sie vermißt.
Deshalb wird erst mit ihrer zunehmenden Bedrohtheit, beginnend mit der
Neuzeit, "unberührte" und "unbeschädigte Natur" in allen Gattungen europäischer
Kunst zunehmend zur Metapher für Nicht-Entfremdung, spirituelle Heimat
und politische Utopie.
In der Musik ist eine Hochphase mit der Spätromantik erreicht,
mit
Wagner
,
Bruckner
und
Mahler
,
mit
Smetata
,
Dvorak
und
Raff
.
Dem entspricht eine zweite, unabhängige Entwicklungslinie, in der die
musikalische Komposition ihre "natürlichen Grundlagen" punktuell, aber
deutlich auf die Ebene der bewußten Reflexion, Gestaltung und Rezeption hebt.
Beide Entwicklungen werden in der beginnenden Moderne fortgesetzt, aber
bald in andere stilistische Gestalten und programmatische Haltungen
dialektisch umschlagen, und so unsere musikalische Umwelt bis heute
stark beeinflussen.
Der Vortrag will an Beispielen des sinfonischen Schaffens
Gustav Mahlers
(1860-1911) dessen programmatischen und ästhetischen Umgang mit
den Begriffen von "Natur und Umwelt" aufweisen, und seine sowohl
exzeptionelle als auch typische Stellung an einem wichtigen
Umschlagspunkt dieser beiden Entwicklungslinien.
|
|
[lepperm_draese09]
Lepper, Markus
Arbeitsplatz nach Rembrandt
Anmerkungen zu einer Installation von Markus Draese
Berlin, 2009
[.html-Dokument]
|
[lepper_f_moll]
Lepper, Markus
Zum Formplan meiner f-moll-Sonate
Berlin, 2009
[.pdf-Dokument]
[Zusammenfassung]
Der Autor beschreibt
...
- der abstrakten Grundlagen der Sonatenhauptsatzform,
- des Prinzips der übergeordneten Vermittlungsprozesse musikalischen Materials,
- die konkrete Umsetzung dieser beiden Punkte in seinem op. 3
- auch unter Bezug auf die historische Entwicklung.
|
[abstract]
The author briefly describes
...
- the abstract principles of the sonata form,
- the principle of super-ordinated synthesizing processes of musical matters,
- how he dealt with both in his op. 3
- w.r.t. the historical situation.
|
|
[lepper_fis_moll]
Lepper, Markus
Zum Formplan meiner Zweiten Klaviersonate
Berlin, 2009
[.pdf-Dokument]
[Zusammenfassung]
| Der Autor beschreibt einige grundlegenden Wirkungsweisen
musikalischer Dialektik anhand seines op. 11 |
[abstract]
| The author describes some fundamental mechanisms of musical dialectics
using his op. 11 as an example. |
|
[lepper06faustfv]
Lepper, Markus
Vorwort zu "Faust Eins Eins" und "Margarete"
Gemeinsames Vorwort zu op.27 und op.33
Berlin, Februar 2012
[.pdf-Dokument]
[Zusammenfassung]
Der Komponist äußerst sich kurz zu
...
- Entstehungsgründe und -geschichte und philosophischem Hintergrund,
- Großformale Disposition.
- Prinzipien Techniken der Textumsetzung im Kleinen,
- Anweisungen zur Interpretation und Anregungen zu Inszenierung und Rezeption.
|
[abstract]
The composer briefly writes about
...
- history and motivation of the creative process and philosophical background,
- formal disposition in the large.
- prinicpals and techniques of text treatment, in the small
-
instructions for performing and suggestions for
mis en scène
and reception
|
|
[lepper06whynotword]
Lepper, Markus
Why Not Word ?
Open letter to all colleagues working on the
ASP/RMIS project in Tirane, Albania
Tirane, 2006
[.html document]
[Zusammenfassung]
| Erklärung des "Modell-Characters von Text" und die Bearbeitungsmöglichkeiten
von Text durch Kommandozeilen-Werkzeuge. Wendet sich
vom Standpunkt des Informatikers an alle "windows"-Benutzer. |
[abstract]
| Explanation on the notion of "text as a model", and on the ways to
treat texts from a command line driven processor.
Adressing all "native windows" users, from the viewpoint of a computer scientist. |
|
[btlepper03cardinality]
Trancón y Widemann, Baltasar and Lepper, Markus
Cardinality Analysis for Recursive Types
in: Proceedings of the Fourth International Symposium
on Trends in Functional Programming,
Gilmore, Stephen(edts.)
Heriot-Watt University, Edinburgh, 2003
[.pdf document]
[abstract]
The traditional approach to recursive types in higher-order
functional langs imposes strong restrictions on admissible
recursion schemata: a sum of products of simple type expressions,
possibly parametric, is the norm. In this paper, we advocate a more
liberal type definition lang, combining standard type
constructors and first-order parametric polymorphism with arbitrary
recursion and some useful non-free constructs.
The existence of
fixpoints and some other properties of the defined types, e.g.,
the existence of a computable equality and total order, can be
inferred by abstract interpretation of the type equations in terms
of
cardinality classes
.
Keywords: recursive types, polymorphism, fixpoint semantics,
cardinality, abstract interpretation
|
|
[lepper04infgw]
Lepper, Markus
Informatik und Geisteswissenschaften --- Erkenntnismöglichkeiten im Spannungsfeld von Analyse und Synthese.
Entwurf eines Programmes für eine mögliche "Musikinformatik"
Berlin, 2005
[.html-Dokument]
[Zusammenfassung]
Überlegungen zur Didaktik und Grundlagen eines Curriculums eines
möglichen Faches "Musikinformatik", ausgehend von fogenden These:
- Informatik ist angewandte Mathematik, ist Systemweissenschaft, nicht
Gerätewissenschaft.
-
Ihre Anwendung auf jedwede
Geistes
wissenschaft stellt besondere
Herausforderungen sohwohl an die Methodik als auch an die konkreten technologischen
Resultate.
- Diese Herausforderungen werden die Informatik als solche bedeutend befruchten,
- aber auch die Domänen-Disziplin selbst kann ihre Begrifflichkeit und ihre
Methoden durch Auseinandersetzen mit / Messen an der mathematischen Modellierung
grundsätzlich weiterentwickeln.
|
[abstract]
Considerations about didactics and curricula of a future "informatics of music".
Basic theses are
...
- Informatics is applied mathematics. It is reasoning on systems, not on
machines.
- Its application to any area of humanities imposes special challenges
onto its methodology, as well as onto the resulting technical solutions.
- These challenges will be fruitful for informatics / computer science as such.
- But also the domain theories themselves will make substantial
progress by newly introducing the method of mathematical modeling.
|
|
[lepper03mpmodeling]
Lepper, Markus
"Meta-Physical Modeling" in der ästhetischen Forschung
Berlin, 2003
[.html-Dokument]
[Zusammenfassung]
Grundlegendes Konzeptpapier für ein computerbasiertes Modell von Musik.
Die Grundthesen sind
...
-
Ästhetische Produktionstätigkeit hat immer wichtige Anteile von
Forschung
.
- Deswegen muß ein Computer-Modell unbeschränkt offen sein für
Re-Definitionen und Ereiterungen.
- Insbesondere müssen Morphismen, nicht Objekte, die first-class-residents
sein.
Diese Thesen werden mit Beispielen aus Klassik und Romantik verdeutlicht.
|
[abstract]
Fundamental concept for a computer based model of music.
Basic theses are
...
-
Production of art is always a kind of
research
.
- Therefore a computer based model must be open for unlimited re-defintion and
extension.
- Esp. morphisms, not objects, must be first-class-residents.
These theses are illustrated with small examples from classical music.
|
|
[lepper03orchw]
Lepper, Markus
Anmerkungen zu meinen Orchesterwerken
Berlin, 2003
[.html-Dokument]
[Zusammenfassung]
Der erste Teil des Artikels gibt eine Überischt über die Entwicklung der
Sonatenhauptsatzform und der Harmonik, die ja deren Struktur und Ideen
materialisieren muß, von ihren Anfängen bis heute.
Im zweiten Teil beschreibt der Autor seine eigenen Lösungen, wie
in der
f-moll-Sonate
op. 3 und den drei
Symphonnien op 14 bis 16
.
|
[abstract]
The first part of the paper gives a survey on the devolopment of the
sonata form ("Sonatenhauptsatzform") and of the harmonics needed to
fill its grid and to transport its ideas, from the classical
period up to now.
In the second part the author desribes his ohwn solutions,
as found in the
f-moll-Sonate
op. 3 and the
three symphnonies op. 14 to 16.
|
|
[lep04]
Lepper, Markus
MWatch
-- An Algorithm for Real-Time Evaluation of Temporal Trace Specifications
Technische Universität Berlin, Berlin, 2004
[.pdf document]
[Zusammenfassung]
Diese Arbeit präsentiert und diskutiert
einen Algorithmus, der das Verhalten eines beliebigen dynamischen
Systems (= "System Under Test" = "SUT")
mit einer Spezifikation vergleicht, die eine Menge von
erlaubten Verhaltensweisen beschreibt.
Der Algorithmus wird definiert durch eine rein funktionale mathematische
Darstelöung
und seine Vollständigkeit, Korrektheit, Terminierung und Konfluenz
werden bewiesen.
Der Algorithmus arbeitet in Realzeit, insofern als er gleichzeitig
mit dem SUT ausgeführt wird, und zu jedem
Zeitpunkt ein Verdikt liefert, ob das Verhalten des SUT bis jetzt
eine Erfüllung der Spezifikation noch erlaubt oder gar bereits impliziert.
Die Spezifikationen werden in einer eigenen, aber durchaus kanonischen
Sprache erstellt, welche die bekannte Syntax und Semantik von
regulären Ausdrücken erweitert um die konjunktive Verknüpfung und um
die Bedingungen bezgl. minimaler und maximaler Dauer von Unterausdrücken.
Ein Spezifikationsausdruck beschreibt eine Menge von erlaubten Verhaltensweisen
unmittelbar, insofern als eine syntaktische Folge von Unterausdrücken
direkt der zeitlichen Abfolge von Unterabschnitten des Verhaltens entspricht.
Die Ausdrucksfähigkeit der Spezifikationssprache entspricht einer
temporalen Intervallogik zuzüglich Dauernanforderungen als
first class residents
, aber ohne Negation.
Die Grundlage ihrer Semantik und der
Arbeitsweise des Algorithmus ist die Arithmetik von Intervallen
über dem Continuum.
Der Algorithmus bedarf, um auf ein beliebiges System angewandt zu
werden, der Implementierung einer jeweils entsprechenden
Adaptiven Schicht. Die Anforderungen an diese
werden in der Arbeit spezifiziert.
Der Algorithmus ist Kernbestandteil des im industriellen Kontext
entwickelten Werkzeugs
MWatch
, welches als Bibliotheksbaustein
für die
Matlab/Simulink
-Umgebung implementiert ist, und für die
Auswertung von Testdaten eingesetzt werden soll.
Darüber hinaus enthält das Werkzeug eine Instanz der Adaptiven Schicht,
welche im Haupttext erläutert wird, und realisiert eine programmierbare und
zwei graphische Benutzerschnittstellen, welche in den
Handbüchern ([lep04a], [lep04b]) beschrieben werden.
|
[abstract]
This thesis presents and describes an algorith which compares the
behaviour of an arbitrary dynamic system (= "System Under Test" = "SUT")
with a specification which describes a set of permitted behaviours.
The algorithm is given a pure functional mathematic modek, and its
completenes, correctness, termination and confluence are proved.
The algorithm works in real-time, as it is perforemd synchronuously with
the SUT, and continuously delivers a verdict indicating whether the
behaviour up to the current time instance still fulfills the specification,
or even will fulfill the total specification it up to the end of the run in any case.
Specifications are given in a propreitary, but canonical lang, which
enhances the standard of regular expressions by conjunction and minimal
and maximal duration requirements.
A specification term describes a set of allowed traces in a
direct way, as the sequential order of sub-expressions
represents the concatenation ("chopping") of sub-traces.
The expressivenes of this lang is that of
temporal interval logics plus duration constraints as
first class residents
, but without negatioon.
first class residents, but without negatioon.
The basis of its sematics and the operation of the algorithm is the
arithmetic of intervals of the continuum.
For monitoring the behaviour of an arbitrary system, the algorithm will
need the implementation of an "adaptive layer". Its interfaces and
requirements are defined in this text.
The Algorithmus is central component of the
MWatch
tool, which is
implemented as a
Matlab/Simulink
library object, and which
shall be used in an industrial context for test data evaluation.
Furhtermore, this tool contains one instance of the abovementioned adaptive
layer, one API, and two user interfaces. These are explained in two
manuals, [lep04a] and [lep04b].
|
|
[lep04a]
Lepper, Markus
MWatch Extended Tutorial
Technische Universität Berlin, Berlin, 2004
[.pdf document]
[Zusammenfassung]
|
Erläutert die Bedeutung und Verwendung der
MWatch
Sprachkonstrukte
(cf. [lep04]) durch praktische Experimente mit der existierenden Implementierung
für
Matlab/simulink
.
|
[abstract]
|
Explains the semantics of the
MWatch
lang constructs
(cf. [lep04]) by concrete experiments, carried out with the
exisiting
Matlab/simulink
implementation.
|
|
[lep04b]
Lepper, Markus
MWatch Installation and User's Guide
Technische Universität Berlin, Berlin, 2004
[.pdf document]
[Zusammenfassung]
Beschreibt die existierende Implementierung des
MWatch
Werkzeuges
(siehe [lep04])
als
Matlab/simulink
Bibliotheksobjekt:
(1) Installationsprozedur.
(2) Die Spezifikationssprache. Diese besteht in der eigentlich
MWatch
Sprache, erweitert um die Ausdrücke, welche die
Adapterschicht konfigurieren.
(3) Die Benutzung des GUI.
(4) Die Benutzung des
Matlab
Kommndozeilen-Interfacces.
(5) Die Benutzung des API.
|
[abstract]
Describes the existing implemention of the
MWatch
tool (cf [lep04]),
which is a
Matlab/simulink
library object;
(1) Installation procedure.
(2) The tool's langauge, which is the
MWatch
kernel lang,
enhanced by the expressions which control the adaptive layer,
(3) Ths use of the GUI.
(4) Ths use of the
Matlab
command line interface.
(5) Ths use of the API.
|
|
[tlw03]
Trancón y Widemann, Baltasar and Lepper, Markus and Wieland, Jacob
Automatic Construction of XML-based Tools seen as Meta-Programming
in: Automated Software Engineering, Vol.10, pg.23-38,
Mascolo and Emmerich and Finkelstein(edts.)
Kluwer Academic Press, Dordrecht, 2003
ISSN 0928-8910
[.pdf document]
[abstract]
This article presents XML-based tools for parser generation
and data binding generation. The underlying concept is that of
transformation between formal langs, which is a form of
meta-programming. We discuss the benefits of such a declarative
approach with well-defined semantics: productivity, maintainability,
verifiability, performance and safety.
Keywords: XML, SAX, DOM, TDOM, ANTLR, XANTLR,
compiler construction, meta-programming,parser generation, data binding generation
|
|
[lt03]
Lepper, Markus and Trancón y Widemann, Baltasar
Co-Algebraic Modeling as an Adequate Means for the
Representation, Rendering and Discussion of Transcendentally Defined AEsthetic Objects
in: Proceedings of the 5th Triennial Conference of the
European Society for the Cognitive Science of Music,
Institute for Research in Music Education, Hannover, 2003
ISBN 3-931825-66-0
[.pdf document]
[Zusammenfassung]
Ein universelles Computermodell von Musik sollte alle denkbaren Arten von
Materialien, Strukturen und Zeitorganisationsformen unterstüzten.
Die dazu notwendige Erweiterbarkeit und Benutzerdefiniertheit
kann am natürlichsten und einfachsten
erreicht werden durch co-algebraische Modellierungstechniken.
|
[abstract]
Any versatile computer of music should support all thinkable kinds of
material, structure and time organizaion without any limit and prejudice.
This can be achieved by a co-algebraic way of modeling, which supports
extensibility and user definedness, in a most natural fashion.
|
|
[ltw03a]
Lepper, Markus and Trancón y Widemann, Baltasar and Wieland, Jacob
TUB-TCI -- An Architecture for Dynamic Deployment of Test Components
in: 15th IFIP International Conference, TestCom 2003, Lncs, Vol.2644, pg.279-294,
Springer, Berlin, 2003
ISBN 3-540-40123-7
[.pdf document]
[abstract]
The test definition lang
TTCN-3
is currently under standardization
by
ETSI/ITU-T
.
Its intended field of application is testing and performance measurement of
communication hard- and software.
TTCN-3
does include mechanisms for specifying remote hardware access
and for distributed execution of testing code components.
But for running compiled
TTCN-3
code distributed onto distinct tagss
of different vendors an architecture is needed which offers standardized means
for dynamic, program controlled deployment, configuration and status inquiry
of active and passive resources.
TUB-TCI
is a proposal for such an architecture, characterized by
(1) totally generic definition of component classes,
(2) coexistence of standardized (XML based)
and specialized (high-speed) communication channels,
(3) a model-based,
strictly formal definition given in
Z
and
(4) a simple, minimized but powerful execution model.
Especially because of the integration of non-standard, high speed data channels
TUB-TCI seems applicable for dynamical routing of
real-time signals in general, beyond the field of test execution.
|
|
[lep02c]
Lepper, Markus
Wege zum Weihnachtsoratorium
MUP e.V., Essen, December 2002
Hier finden Sie
Teile I, II und V des unvollendeten Textes als .pdf Dokument
und, ganz wichtig, da es ja um
Orientierungshilfe
geht,
die vielfältige Falt-Tafel
zum Selber-Falten.
[Zusammenfassung]
Behauptet wird, daß alle sechs Teile des
Weihnachtsoratoriums
von
Johann Sebation Bach
, entgegen der zunächst überwältigenden
formalen Vielfalt an der Oberfläche, im Untergrund streng immer derselben
Satzfolge gehorchen, nämlich
...
Eingangsatz, dann zweimal (Secco Accompagnato Arie Choral)
Die Verunklarungen dieser Formel in der Vordergrund-Gestalt sind erklärbar durch
Interferenzen mit anderen, querständigen formalen Prozessen, die aber ihrerseits
äußerst einfach und nachvollziebar sind.
Diese werden als Sammlung von "Regeln" dargestellt, und die zunehmende
Komplexierung der Vordergrundgestalt als sich aus diesen organisch ergebend
nachgewiesen.
|
[abstract]
Central thesis is that all six parts of the
Weihnachtsoratoriums
by
Johann Sebation Bach
follow the same formula w.r.t. the sequence
of movements, namely
...
Opening, and then twice the sequence(secco accompagnato aria choral)
In the "Hintergrund", this formula stuck to without modification,
despite the broad range of variability in the "Vordergrund-Gestalt".
This variability is explained by interaction with other, different and
non-orthogonal formal processes, which
per se
are again
simple and well comprehensable.
These processes are presented as a collection of "rules", and the
increasing complexity of the foreground is explained as the natural
consequence of their interaction.
|
|
[lep02b]
Lepper, Markus
TUB-TCI -- A Generic Architecture for Distributed Test Execution
TU Berlin, Fak IV, Berlin, September 2002
ISSN 1436-9915
[.pdf document]
[abstract]
TUB-TCI is an architectur to support the execution of test software in a
distributed environment, where hardware tagss of different vendors, using
different technologies shall cooperate.
TUB-TCI is designed to support directly the interaction of code generated by
a TTCN-3 compiler.
TUB-TCI identifies categories of subsystems and specifies their interaction.
An operational semantics is given, based on a (slightly enhanced) Z notation.
|
|
[lep02a]
Lepper, Markus
Modeling Music Using XML -- Some Basic Considerations
in: Proceedings of MAX 2002 -- International Conference of Musical
Applications Using XML,
Haus, Goffredo and Longari, Maurizio(edts.)
IEEE Computer Society
--- Technical Committee on Computer Generated Music, Milano, 2002
[.pdf document]
[Zusammenfassung]
| Ein ganzheitlicher analytischer Ansatz, um "alle denbaren" Arten von Musik
durch eine generische und aspekt-orienterte Meta-Modellierung zu unterstützen. |
[abstract]
| The paper gives basic outline of a holistic and analytic
approach to capture all "thinkable" kinds of music in a generic
and aspect-oriented XML-based architecture. |
|
[ltw02b]
Lepper, Markus and Trancón y Widemann, Baltasar and Wieland, Jacob
XML-based Acquisition of Fine-Granular Structured Data
by Grammar Morphisms
in: SUBMITTED TO ER '02,
Berlin, 2002
[.pdf document]
[abstract]
The
DDD
lang and tool is a textual front-end
for comfortable authoring XML documents and acquisition of
structured but flexible data, esp. suited for legacy problems.
DDD
has a two-layered architecture: The upper layer contains
explicit mark-up for ergonomic data input, characterized by
single-character-escaping and tag inference.
In contrast the lower layer does not use mark-up, but
parser definitions by extended regular expressions, which implicitly
construct the data model from every-days textual
representation of structured entities like placees, names,
domain specific notions etc.
The algorithms for transforming the front-end grammar defining terms
into abstract data definitions and then into XML DTD definitions are given,
as well as the algorithm for the parser. All algorithms are
based on term rewriting.
|
|
[wtl01e]
Wieland, Jacob and Trancón y Widemann, Baltasar and Lepper, Markus
A type system for TTCN-3
in: SUBMITTED TO TestCom '02, REJECTED !-(,
Berlin, 2002
[.pdf document]
[abstract]
The introduction of
TTCN-3
into the world of imperative protocol
compliance testing is an important step towards the application of
formal methods
in protocol testing. Since the
TTCN-3
standard
comes without an explicitely defined type system, this paper attempts to close
this gap in the specification, permitting discussions in the community and the
evaluation of compilers on a more exact basis.
The type system presented in this paper has been implemented in the
TTthree
(
TTCN-3
to
Java
) compiler.
|
|
[lep02d]
Lepper, Markus
Automated Test Case Generation from Use Case Specifications
Berlin, 2002
[.pdf document]
[abstract]
Automated test performance and automated test case generation have
been topics of increasing interest in academic research and are of high
relevance to industrial practice.
Based on the analyzation of existing industrial documents and
habits, the paper presents (1) a modeling lang for requirement engineering,
giving exact semantics to the well-known, bur usually only imprecisely
specified "Use Case" approach, (2) a practical-oriented architecture for integrating
well-founded formalisms into existing semi-formal documents, and
(3) an algorithm for deriving test cases with full coverage properties
by means of constraint resolution.
|
|
[ltw01b]
Lepper, Markus and Trancón y Widemann, Baltasar and Wieland, Jacob
Minimze Mark-Up ! - Natural Writing Should Guide the Design of Textual Modeling Frontends
in: Conceptual Modeling -- ER2001, LNCS, Vol.2224,
Springer, Berlin, November 2001
ISBN 3-540-42866-6
[.pdf document]
[abstract]
Designing and implementing modeling frontends for domains in which
text
is predominant (it may be informal, semi-formal or formal)
can and should benefit from using the evolving standard mark-up langs
SMGML
and
XML
, since standardization of interfaces,
transmission and storage protocols as well as many valuable tools "come for free".
But the idiosyncratics of the existing mark-up concepts neither provide a structure
clean enough to serve as foundation for syntax and semantics of exact modeling
frontends, nor do they offer an
input
format feasible for text-based data
maintanance.
Direct Document Denotation
(=
DDD
) as presented in this paper
tries to remedy these defects: (1) it abstracts from the rough edges of XML,
(2) it realizes a practical frontend processor for denotation of structured
documents with special considerations to disabled users and voice controlled input,
- and (3) is described completely and mathematically precise as a small system
of transformation relations.
The theoretical basics and practical issues of
DDD
are discussed and a
case study is reported.
|
|
[glst01]
Grieskamp, Wolfgang and Lepper, Markus and Schulte, Wolfram and Tillmann, Nicolai
Testable Use Cases in the Abstract State Machine Lang
in: Proc. of the APAQS 2001 conference,
IEEE Computer Society Press, Washington, DC, 2001
ISBN 0-7695-1287-9
[.pdf document]
[abstract]
Use cases are a method for describing interactions between humans and/or systems.
However, despite their popularity, there is no agreed formal syntax and semantics
of use cases.
The Abstract State Machine Lang (
AsmL
) is an executable specification
lang developed at Microsoft Research. In this paper we define an encoding of
use cses in
AsmL
and demonstrate the advanteges by decribing techniques
to generate test cases and test oracles from the encoding.
|
|
[tlw01a]
Trancón y Widemann, Baltasar and Lepper, Markus and Wieland, Jacob
Automated Generation of Abstract Syntrax Trees
Represented as Typed DOM XML
in: : Proceedings of XML and Software Engineering (XSE 2001), pg.20-23,
W. Emmerich and C. Mascolo(edts.)
University College London, London, 2001
[.pdf document]
[abstract]
The XANTLR/TDOM project is an implementation of a
typed
XML Document Object Model
initially used to represent abstract syntax trees in a compiler project.
Tree classes, SAX event receivers, visitor classes and DTD are automatically
derived from a sparsely annotated ANTLR grammar.
Mapping tag values onto the type system of the target lang allows for the
compilation of syntax, mostly yielding large increases in computational performance.
Automized generation significantly decreases programming efforts and increases
maintainability.
The currently supported target lang is JAVA.
|
|
[gl00a]
Grieskamp, Wolfgang and Lepper, Markus
Using Use Cases in Executable Z
in: ICFEM 2000 - IEEE Conference on Formal Engineering Methods,
IEEE Press, Washington, September 2000
ISBN 0-7695-0822-7
[.pdf document]
[abstract]
Use Cases are a wide-spread informal method for specifying
the requirements of a technical system in the early development
phase. Z is a formal notation which aims to support, beside
others, the specification of early requirements.
In this paper,
we develop a representation of Use Cases in Z and apply it to
several examples. Our focus is on instrumenting the formalization
for black-box test evaluation in Executable Z, a
computation model and implementation for Z based on concurrent
constraint resolution.
Keywords:
Use Cases, Z, Execution, Test Data Evaluation
|
|
[gl00b]
Grieskamp, Wolfgang and Lepper, Markus
Encoding Temporal Logics in Executable Z: A Case Study for the ZETA System
in: LPAR 2000 - 7th International Conference on Logic for
Programming and Automated Reasoning, LNCS,
Springer Verlag, Berlin, Heidelberg, New York, November 2000
ISBN 3-540-41285-9
[.pdf document]
|
[glw00a]
Grieskamp, Wolfgang and Lepper, Markus and Wieland, Jacob
Constraint Programming in Z
Berlin, March 2000
[.pdf document]REJECTED \tt ;-([abstract]
| We present a setting for ``programming'' in the set-based
specification lang Z which is based on concurrent constraint
resolution. The setting is implemented as part of the tool
integration environment Zeta, where it is used for executing
specifications for the purpose of test-data evaluation and simulation. |
|
[lepperm_klangklavier]
Lepper, Markus
Grundsätzliche Anmerkungen zur Klangbehandlung
in meinen Werken für Pianoforte
(solo und mit Gesang).
Essen, 1999
[.pdf-Dokument]
[Zusammenfassung]
| Der Komponist gibt an, wie seine Kammermusik für/mit Pianoforte klanglich
gemeint ist, und wie sie gespiel, gehört und elektroakustisch
aufgenommen werden sollte. |
[abstract]
| The composer explains how his chamber music for/with pianoforte is
meant, how it should be played, heared and recorded. |
|
[lepperm_polyparadigma]
Lepper, Markus
Polyparadigmatisches Komponieren
Ein Beitrag zur Didaktik, wider die multi-mediale Beliebigkeit
Essen, 1999
[.pdf-Dokument]
[Zusammenfassung]
| Grundsätzliche und konkrete Überlegungen,
wie im Rahmen einer professionellen Ausbildung zum Komponisten einer
rein auf Effekt ausgerichteten "multi-medialen"
Betriebsamkeit der Begriff eines "poly-paradigmatischen" Schaffens
entgegengestellt werden sollte, welches vorurteilslos und synästhetisch
Techniken und Technologien, Materialien und Strategien kombiniert,
dabei aber "nach der Wesen Tiefe trachtet". |
[abstract]
| Fundamental and detailed considerations how (in the context of
university teaching in musical composition) a "poly-paradigmatic"
way of thinking and creating can be put against the effect-oriented
multimedia hustle.
This poly-paradigmatic composing shall combine techniques and technologies.
materials and strategies from very different areas, but operate
on the levels of background logic and ontologies,
"And only into beings would delve deep". |
|
[lepperm_leuchten]
Lepper, Markus
Das Leuchten der Nacht - kleiner Rückblick auf die
"ex machina Medien-Nacht"
in: senza-tempo, Kleines Archiv für Musikphilosophie, Nr.Sondernummer Dezember 99, pg.1-10, Essen, 1999
[.pdf-Dokument]
[Zusammenfassung]
|
Besprechung eines Nachtkonzertes mit Kombinationswerken aus Musik / Video,
von
Xavier Garavaglia
/
Gruppe animato
,
Dirk Reith
/
N N
,
Dietrich Hahne
/
Ivar Smedstad
und
Ludger Brümmer
/
Silke Braemer
.
|
[abstract]
|
Review of a nightly concert with works combining music / video, by
Xavier Garavaglia
/
Gruppe animato
,
Dirk Reith
/
N N
,
Dietrich Hahne
/
Ivar Smedstad
and
Ludger Brümmer
/
Silke Braemer
.
|
|
[lepperm_ruhrwerk]
Lepper, Markus
Zum Ruhrwerk - Anmerkungen eines rührigen Ruhris
in: senza-tempo, Kleines Archiv für Musikphilosophie, Nr.Sondernummer Oktober 99, pg.1-10, Essen, 1999
[.pdf-Dokument]
[Zusammenfassung]
|
Besprechung von
Dss Ruhrwerk
von
Wolfgang Hufschmidt
anläßlich
der Uraufführung in Essen, 1999.
|
[abstract]
|
Review of
Dss Ruhrwerk
by
Wolfgang Hufschmidt
,
on the occation of its premiere in Essen, 1999.
|
|
[lepperm_mai]
Lepper, Markus
Einleitende Worte zur Uraufführung von
"Künftiger Mai"
am 18. September 1999 in den Keramischen Werkstätten Margarethenhöhe
auf Zeche Zollverein
in: senza-tempo, Kleines Archiv für Musikphilosophie, Nr.Sondernummer September 99, pg.1-6, Essen, 1999
[.pdf-Dokument]
[Zusammenfassung]
|
Der Komponist spricht (a) über den Entstehungshintergrund seines op. 19,
über (b) die politische Dimension der
Heine
-Gedichte und (c) ihren
merhfachen Bezug zum Aufführungsort, und über (d) die Analogie zwischen der
internen Stimmungskurve des Werkes und
Heine
s Lebensgeschichte.
|
[abstract]
|
The composer talks (a) about the background of writing his op. 19,
(b) the political dimensions of
Heine
's poems, (c) their multifold
relation to the place of this premiere,
the
Keramische Werkstätten Margarethenhöhe
),
and (d) about the analogous deveolpments of the atmonspheres of the songs, and
the history of
Heine
's life.
|
|
[lepperm_numerischebkdf]
Lepper, Markus
Numerische Befunde in den Takten eins bis zehn der
"Kunst der Fuge"
und ihre Indikatorfunktion
in: senza-tempo, Kleines Archiv für Musikphilosophie, Nr.5, pg.17-48, Essen, 1999
[.pdf-Dokument]
Wichtiger Bestandteil ist die
FALTTAFEL
!
[Zusammenfassung]
|
Die Anwendung von sehr schematischen Zählweisen auf die ersten zehn(10) Takte der
Kunst der Fuge
bringt Ergebnisse, die als Indikatoren für etwas
gehaltvollere Aussagen dienen können.
|
[abstract]
|
Applying rather schematic methods of counting to the text of the first ten(10) bars
of the
Art of Fugue
yields some results which are indicators for more
contentful statements.
|
|
[lepperm_musikundzahl]
Lepper, Markus
Musik und Zahl
in: senza-tempo, Kleines Archiv für Musikphilosophie, Nr.5, pg.1-16, Essen, 1999
[.pdf-Dokument]
[Zusammenfassung]
Verschiedene grundlegend unterschiedliche Methoden der Verwendung von
Zahlen
beim Reden über (und Analysieren von) Musik werden expliziert.
Dann wird gezeigt, daß seriöses Reden über Musik diese verschiedenen Arten
säuberlich
trennt
, --- Scharlatanerie sie hingegen vermischt.
|
[abstract]
The fundamental different ways of using
numbers
when talking about and analyzing
music are distinguished and explained.
It is demonstrated that professional analysis is characterized
by keeping these separate, while charlatanism operates by intermixing them.
|
|
[lepperm_mahlergesamt]
Lepper, Markus
Architektur des spätromantischen Lebenswerkes am Beispiel der Sinfonien
Gustav Mahlers
in: senza-tempo, Kleines Archiv für Musikphilosophie, Nr.4, pg.6-24, Essen, 1999
[.pdf-Dokument]
[Zusammenfassung]
|
Ausgehend von der These, daß ein Komponist, während sein Lebenswerk entsteht,
einer Gesamtplanung folgt, die sich aber im Laufe ihrer Umsetzung verändert,
wird versucht, für die Sinfonien
Gustav Mahlers
eine hypothetische Folge
solcher Konzepte aufzustellen.
|
[abstract]
|
The article states that a compsers follows a concept of his/her life-time work,
which is adopted and revised over time.
W.r.t. the symphonies of
Gustav Mahler
, a series of these (hypothetic)
concepts is presented.
|
|
[lepperm_trinitarischet]
Lepper, Markus
Die Trinitarische Tripelfuge
in: senza-tempo, Kleines Archiv für Musikphilosophie, Nr.2 - 3, Essen, 1998
[.pdf-Dokument]
[.pdf-Dokument]
[Zusammenfassung]
Der Artikel behauptet,
...
(1) daß eine bestimmte Kombination von Themen-Typen in der Disposition
vieler Tripel-Fuge bei
J. S. Bach
sich unmittelbar bezieht auf
die "Vater-Sohn-Geist-Trinität" der christlichen Religion,
(2) daß diese spezielle Kombination von Texturen (auch aus
rein satztechnisch-praktischen und rezeptionstechnichen Gründen) zu
einem eigenen
Topos
geronnen ist,
der sich (3) z.B. ausführlich bei
Beethoven
findet, und
(4) daß die motivische Entsprechung der "Geist-Themas"
aus der
Großen Es-Dur-Fuge
, BWV 552,
und der Textstelle Tkt 32 "Der Geist" in der
Motette "Der Geist
hilft unsrer Schwachheit auf"
, BWV226,
belegt, daß diese Bedeutung zumindest von
Bach
bewußt
als solche
gesetzt worden ist.
|
[abstract]
The article states that
(1) a certain combination of certain styles of themes in many triple-fuges of
J. S. Bach
is directly related to the "Father-Son-Spirit-Trinity" of
the Christian religion.
(2) This special combination of textures has become a
topos
on its own,
--- also for practical, compositorical (better: "satztechnische" !)
reasons, and because its ease of
reception.
(3) This topos can also be found in the works of
Beethoven
.
(4) The identity between bar 32 (with the text "the spirit") of
his
motet "Der Geist hilft unsrer Schwachheit auf"
, BWV226,
and the "spirit"-theme in the
Grear E-flat-Major Fugue
, BWV 552, proves that this
equivalence has been used by
Bach
consciously
.
|
|
[lepperm_wk1cismoll]
Lepper, Markus
Singularitäten und "transzendierender Formteilrhythmus"
in der cis-moll-Fuge des ersten Bandes des
Wohltemperierten Clavieres
in: senza-tempo, Kleines Archiv für Musikphilosophie, Nr.1, Essen, 1998
[.pdf-Dokument]
[Zusammenfassung]
Wichtige Singularitäten in der cis-moll-Fuge des ersten Bandes
des
Wohltemperierten Clavieres
erscheinen im Abatand von
(a) Quadratzahlen und (b) VIelfachen von 11 (elf).
Diese beiden Rhythmen schneiden sich
erst außerhalb
des Werkes.
Diese Tatsache hat trans-musikalichen Gehalt.
|
[abstract]
Singfificant singularities in the cis-minor fugue of the first volume of
Das Wohltemperierte Clavier
occur in the rhythms of
(a) square numbers and (b) multiples of eleven.
These both rhythms meet
after
the end of the piece.
This fact carries trans-musical semantics
|
|
[lepperm_kompositiondds]
Lepper, Markus
Komposition als Disposition von Datentransformation und Sprachdesign
Essen, 1999
ISBN 3-89206-948-4
[.pdf-Dokument]
|
[lepperm_atmen]
Lepper, Markus
Das Atmen der Kulturen
Essen, 1998
[.pdf-Dokument]
[Zusammenfassung]
|
Überlegungen zur Bedeutung des
yhthmus
im Ablauf von Tagen, Wochen, Jahren,
im menschlichen Leben und seiner kulturellen Einbettung.
|
[abstract]
| Thoughts about the importance of periodical and rhythmical order (on the
large scales of days, weeks and years) for human perception and culture. |
|
[lepperm_lingart]
Lepper, Markus
"lingart" ---
Projekt zur Modellierung von Domain-Sprachen
im Bereich der ästhetischen Produktion.
Essen, 1997
[.pdf-Dokument]
[Zusammenfassung]
|
Entwurf einer Folge von kleinen Projekten, in denen die
Domän-Sprache
je
eines künstlerisch-ästhetischen Bereiches mit professionellen Methoden
der wissenschaftlichen Informatik in eine exakte Form gegossen werden soll.
|
[abstract]
|
Desing of a sequence of tiny projects for constructing exact
models of the
domain langs
from differente areas of art and
aesthetics, using professional methods from scientific informatics.
|
|
[lepperm_funsym]
Lepper, Markus
Vorschlag eines Rahmenwerkes zur exakten Definition von Semantiken
Funktionalharmonischer Symbolsysteme
Essen, 1997
[.pdf-Dokument]
[Zusammenfassung]
Es wird eine kurze Einführung in historischen Ort und
das Verfahren der "Funktionalharmonischen Analyse" gegeben.
Dann wird eine Realisierung einer der vielen möglichen Varianten
des dazu verwendeteten Symbolsystems in Form der Spezifikation einer
rechnerverständlichen Sprache vorgestellt
Die Semantik dieser Sprache wird spezifiziert.
Zuletzt wird diskutiert, wieweit die Idiosynkrasien und Antiorthogonalitäten
der in der Geschichte der Musiktheorie entwickelten unterschiedlichen
Symbolsysteme durch Vergleich mit einem solchem "exakt spezifiziertem"
System eindeutig erkannt, bezeichnet und evtl. interpretiert werden können.
|
[abstract]
First there is a short introduction into the method of functional harmonic analysis.
Then a formal lang is constructed to represent one of the many possible
symbolic calculi for functional harmonic analysis.
The semantics of this language are specified based on a norion of "chord"
encoded by distances of fifth intervals.
Finally it is discussed how far the idiosyncratics and non-orthogonalitties
of the different calculi found in the history of music theory can
be recognized, classified and interpreted by a comparision to an
exacly defined system like the one presented herein.
|
|
[lepperm_draese]
Lepper, Markus
Ölmalerei im Zeitalter der elektronischen Medien ---
-- Einige ganz subjektive Anmerkungen zum Werk Markus Draeses.
Essen, 1995
[.html-Dokument]
|
[lepperm_kleinecem]
Lepper, Markus
Kleine Kompositionslehre der Elektronischen Musik
in: Kultur und Technologie im 21. Jahrhundert, pg.378-395,
Gert Kaiser, Dirk Matejovski, Jutta Fedrowitz(Hrsg.)
Frankfurt a.M., 1993
ISBN 3-593-34805-5
[.html-Dokument]
[Zusammenfassung]
Die "Lehre von der Komposition Elektronischer Musik" wird
dargestellt als gliederbar in die drei Bereiche "voltage control",
"musique concrète" und "Serialismus".
Mit Klangbeispielen werden zunächst die ästhetischen Prinzipien und
Voraussetungen und die praktischen Verfahren bei der Benutzung
analoger
Geräte
demonstriert.
In einem zweiten Teil wird dargestellt, wie der
Digitalrechner
diese
Situation verändern kann und wird.
|
[abstract]
The "Art of Composing Electronic Music" is considered to consist of
three areas, "voltage control", "musique concrète" und "Serialismus".
Using sound examples, the aesthetic principles and practical processes
are explained, when using
analogous
electronical devices.
In a second part the changes are discussed which may and will be
caused by switching to
digital
processing equipment.
|
|
[lepperm_aposspec91]
Lepper, Markus
Spezifikation des APOS genannten Verfahrens zur datengesteuerten
Programmierung
Essen, 1991
[.pdf-Dokument]
[Zusammenfassung]
| Exakte Spezifikation des APOS Kern-Mechanismen, also von
(a) Quotierung und Blockausewerung und (b) Methodenfindung.
Gegeben als "operationale Semantik" |
[abstract]
| A precise specfication of the APOS kernel logic, i.e. (a) block quoting and
application and (b) method identification, as an "operational semantics". |
|
[lepperm_ichbinderwelt]
Lepper, Markus
Gustav Mahler, "Ich bin der Welt abhanden gekommen"
Abiturklausur im Leistungskurs Musik bei Dr. Edgar Makosch
Essen, 1979
[.html-Dokument]
|
[lepperm_minstrels]
Lepper, Markus
Claude Debussy: Prélude pour Piano, Ier Livre -- No XII -- Minstrels
Klausur im Leistungskurs Musik, Jahrgangsstufe Dreizehn,
bei Dr. Edgar Makosch
Essen, 1978
[.html-Dokument]
|
[lepperm_mahlerachte]
Lepper, Markus
Einführende Worte in die Achte Sinfonie von Gustav Mahler
Essen, 1978
[.html-Dokument]
|
[lepperm_vexations]
Lepper, Markus
Vexations
Versuch der Enträtselung der Komposition
von Erik Satie
Essen, 1977
[.html-Dokument]
|
[lepperm_mann]
Lepper, Markus
Köngliche Hoheit und das Leitmotiv
Anmerkungen zu einem doch nicht ganz so
flachen Roman von Thomas Mann
Essen, 1975
[.html-Dokument]
[Zusammenfassung]
| Die Leitmotiv-Technik aus den Opern Richard Wagners wird von
Thomas Mann bewußt auf die Literatur übertragen.
Dies ist besonders gut nachzuweisen in den Romanen "Königliche Hoheit",
wo die Leitmotiv-Technik explizit erwähnt wird, und "Doktor Faustus",
der ein Komponistenschicksal beschreibt.
Der Vortrag demonstriert die musikalische Motiv-Behandlung im
"Rheingold" und in Gustav Mahlers III. Sinfonie. |
[abstract]
| The "leitmotiv" techniqure from Richard Wagner's operas is
transfered to literature by Thoms Mann in an explicit way.
This is demonstrated with the novels "Royal Highness"
and "Doktor Faustus", compared with musical motifs from "Das Rheingold"
and Mahler's III symphonie. |
|
