moordzaken
HOME
PRIVACY POLICY
DISCLAIMER
ABOUT US
CONTACT US
Home
Is metaprogramming possible in C#?
Is metaprogramming possible in C#?
admin
May 06, 2012
Metaprogramming is possible in .NET (see compiler compilers, regular expressions, code DOM, reflection etc.) but C# is not capable of
template
metaprogramming because it does not have that language feature.
Post a Comment
0 Comments
Featured Post
swift
Does reference counting really use less memory than tracing garbage collection? Mathematica vs Swift vs OCaml vs F# on .NET and Mono
admin
December 26, 2017
Tags
.net
.net core
API
Beltway
C
Eric Lippert
G1
Immix
LMAX
MinCut
OpenCV
PHP
ParallelTable
Texas Multicore Technologies
academic
accumulator generator
advantages
allocation
amd
amorphous
animation
apple
arm
array
asynchronous
asynchronous workflow
benchmark
bitvector
bitwise
bjarne stroustrup
block sorting
bloxors
boehm
book
book sales
boost
boxing
bubble sort
bug
bugs
burrows wheeler
burton smith
business
c#
c++
cache
channel
clojure
clos
clr
code base
common language runtime
compatibility
compiler
computer programming
concurrency
concurrent
concurrent garbage collector
concurrent gc
conservative gc
convolution
copying collection
cpu
data compression
data parallel haskell
database
debian
determinism
diffraction
disadvantages
disruptor
don stewart
don syme
emery berger
erik meijer
erlang
evolutionary
extensibility
f#
f# for technical computing
f# meetup
first-class functions
fortran
free
front end
fsharp
funarg problem
functional
functional programming
funding
g++
game
ganesh sittampalam
garbage collection
gc
gc pause
generational garbage collection
generics
ghc
glyn williams
go
google chrome
google go
goroutine
gpu
graphics
guido van rossum
hash table
haskell
heap
heap sort
herb sutter
higher-order module
hlvm
householder reductions
idiomatic
immutable
imperative
industrial haskell group
industry
intel
interview
io
ipad
ironjs
java
job
jobs
joe marshall
joe pamer
jon harrop
jvm
kde
kde 4
kotlin
language
latency
layout
leak
lecture
lexer
limitations
lines of code
linux
lisp
llvm
loc
local optimization
london
lwt
macro
mailing list
managed code
mark compact
mark region
mark sweep
market
martin odersky
marvell
mathematica
matthew hertz
maximization
median
memory
memory management
memory management myths
memory safety
message passing
microsoft
milestone
ml
mlton
module system
monad
mono
monte carlo
multicore
mutex
nacl
native code
netbook
norman ramsey
numeric tower
numerical
numerical methods
numerical recipes
o'reilly
object oriented programming
ocaml
ocaml for scientists
ocaml journal
optimization
pa_monad
paper
parallel
parallel arrays
parallel garbage collection
parallel programming
parallelism
parser
partial specialization
pattern
pattern matching
paul graham
pause
pause times
performance
perl
phd
plugin
polymorphic variants
polymorphism
product
profit
programming language
programming languages
prompt
proper tail recursion
public
purely functional data structure
pythagoras tree
python
qr decomposition
quadcore
quicksort
racket
raspberry pi
ray tracer
real-time
reddit
reference counting
reference type
regular expression
reified generics
release
reliability
representation
research
review
rewrite
rich hickey
richard jones
rule
rust
sadek drobi
sal mangano
sales
scala
semi-space
shadow stack
share
shared_ptr
simon marlow
size
smart pointers
sml
sse
stack overflow
standard ml
stencil
stop-the-world
structural
swift
symbolic
tail calls
task parallelism
tco
template haskell
thesis
thread safe
threads
throughput
time-frequency analysis
tools
tracing
tracing garbage collection
trading
treadmill
trend
trends
tuples
tutorial
type class
value
value types
variant type
verbosity
video
virginity
vista
visual studio integration
wavelet
weak dictionary
weak references
web
windows
write barrier
xavier leroy
0 Comments