Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Cobra is a discontinued general-purpose, object-oriented programming language. Cobra is designed by Charles Esterbrook, and runs on the Microsoft .NET and Mono platforms. It is strongly influenced by Python, C#, Eiffel, Objective-C, and other programming languages. It supports both static and dynamic typing. It has support for unit tests and contracts. It has lambda expressions, closures, list comprehensions, and generators. Cobra is an open-source project; it was released under the MIT License on February 29, 2008. Object-oriented Namespaces Classes, interfaces, structs, extensions, enumerations Methods, properties, indexers Mixins, extension methods Generics, attributes Quality control Contracts, assertions Unit tests, docstrings Compile-time nil-tracking Expressiveness Static and dynamic binding List, dictionary, and set literals in and implies operator for expressions Slicing Interpolated strings Compile-time type inference Lambdas and closures General productivity Exception handling Postmortem exception report Garbage collection Scripting conveniences Clean syntax Dynamic binding One-step run Shebang line (#!) Miscellaneous Documentation tool (cobra -doc) Syntax highlighting tool (cobra -highlight) The following examples can be run from a file using cobra .
James Richard Larus, Bogdan-Alexandru Stoica
[2]Paolo Prandoni, [3]LCAV, EPFL
This notebook shows a simple way to process audio files (in WAV format)
in a block-by-block fashion; this is useful in two cases
1. when you want to process a data stream in real time but you can
accept a small processing delay; in this case a buffered approach
can yield computational gains
2. when you need to process a large file that does not fit entirely
into "I defy anybody to find a record... unless it is some old blues
record from 1922... that uses feedback that way. So I claim it for
the Beatles. Before H